#include<bits/stdc++.h>

using namespace std;

using ll = long long;

int main()

{

ll T;cin>>T;

while(T--)

{

ll n;cin>>n;

ll ans=0;

map<string,int>mp;

queue<string>q;

while(n--)

{

string name,xv;

cin>>xv>>name;

if(xv=="in")

{

q.push(name);

mp[name]=1;

}

else

{

if(q.front()!=name)

{

while(mp[q.front()]==0)

{

q.pop();

}

if(q.front()==name)ans++;

mp[name]=0;

}

else

{

ans++;

q.pop();

mp[name]=0;

}

}

}cout<<ans<<endl;

}