#include <iostream>
#include <vector>
#include <cassert>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>

#define EACH(x) for(set<pair <int, bool> >::iterator it=x.begin(); it!=x.end(); ++it)

using namespace std;

void solve();
void solve2()
{
  int N;
  cin >> N;
  int pushed = 0;
  for(int i=0; i<N; i++)
  {
    string temp;
    cin >> temp;
    cout << temp << endl;
    assert(temp == "push" || temp == "add" || temp == "subtract" || temp == "negate");
    if(temp == "push")
      pushed++;
  }
  for(int i=0; i<pushed; i++)
  {
    int temp;
    cin >> temp;
  }

}
int main()
{
  int T;
  cin >> T;
  while(T--)
    solve2();
}

void solve()
{
  string D[4] = {"push", "add", "subtract", "negate"};
  stack <set <pair <int, bool> > > A;
  int N;
  int pushed = 0;
  int summed = 0;
  cin >> N;
  for(int i=0; i<N; i++)
  {
    string temp;
    cin >> temp;
//    cout << "pushed : " << pushed << " and summed : " << summed << " and size of A : " << A.size() << endl;
//    assert(pushed - summed == A.size());
    if(!temp.compare(D[0]))
    {
      set <pair <int, bool> > temp;
      temp.insert(make_pair(pushed, true));
      A.push(temp);
      pushed++;
    }
    else if(!temp.compare(D[1]))
    {
      summed++;
      set <pair <int, bool> > x = A.top();
      A.pop();
      set <pair <int, bool> > y = A.top();
      A.pop();
      set <pair <int, bool> > z;
//      set_union(x.begin(), x.end(), y.begin(), y.end(), inserter(z, z.begin()));
      EACH(x) z.insert(make_pair((*it).first, (*it).second));
      EACH(y) z.insert(make_pair((*it).first, (*it).second));
      A.push(z);
    }
    else if(!temp.compare(D[2]))
    {
      summed++;
      set <pair <int, bool> > x = A.top();
      A.pop();
      set <pair <int, bool> > y = A.top();
      A.pop();
      set <pair <int, bool> > z;
      EACH(x) z.insert(*it);
      EACH(y) z.insert(make_pair((*it).first, !(*it).second));
      A.push(z);
    }
    else if(!temp.compare(D[3]))
    {
      set <pair <int, bool> > x = A.top();
      A.pop();
      set <pair <int, bool> > z; 
      EACH(x) z.insert(make_pair((*it).first, !(*it).second));
      A.push(z);
    }
    else
      assert(false);
  }
  //cout << "pushed : " << pushed << " and summed : " << summed << " and size of A : " << A.size() << endl;
  //EACH(A.top()) cout << (*it).first << " " << (*it).second << endl;
//  assert(pushed - summed == A.size());
//  assert(A.size() == 1);

  vector <int> B;
  for(int i=0; i<pushed; i++)
  {
    int temp;
    cin >> temp;
    B.push_back(temp);
  }
  sort(B.begin(), B.end());
  int b_index = 0;
  int ans[pushed];
  int sum = 0;
  EACH(A.top())
    if(!(*it).second)
    {
      ans[(*it).first] = B[b_index];
      sum -= B[b_index];
      b_index++;
    }
  EACH(A.top())
    if((*it).second)
    {
      ans[(*it).first] = B[b_index];
      sum += B[b_index];
      b_index++;
    }

  cout << sum << endl;
  for(int i=0; i<pushed; i++)
    cout << ans[i] << " ";
  cout << endl;

}