#include <bits/stdc++.h>
#define int ll
#define double long double
#define rbtree __gnu_pbds::tree<int,__gnu_pbds::null_type,less<int>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define ALL(X) X.begin(),X.end()
#define F(i,n)  FF(i,0,n)
#define F1(i,n)  FF(i,1,n+1)
#define FF(i,n,m) for(int i=(int)n;i<(int)m;++i)
#ifndef LOCOL
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#endif // LOCOL
//#define mp make_pair
using namespace std;
//using namespace __gnu_pbds;
template<typename T> bool remax(T& a, const T& b) {return b>a?a=b,1:0;}
template<typename T> bool remin(T& a, const T& b) {return b<a?a=b,1:0;}
inline ostream& operator << (ostream& os,__int128_t a){if(a==0) {return (os<<'0');}bool flag=0;if(a<0) {a=-a,flag=1;}string s;while(a){s+=a%10+'0';a/=10;}s+=flag?"-":"";reverse(ALL(s));return os<<s;}
inline istream& operator >>(istream& is,__int128_t& a){string s;cin>>s;a=0;for(auto c:s) a=a*__int128_t(10)+__int128_t(c-'0');return is;}
template<typename T,typename P> inline ostream& operator << (ostream& os,pair<T,P> a){os<<a.first<<" "<<a.second; return os;}
template<typename T,typename P> inline istream& operator >> (istream& is,pair<T,P> &a){is>>a.first>>a.second; return is;}
using ll=long long;
using ull=unsigned long long;
using int128= __int128_t;
using uint128= __uint128_t;
using pii =pair<int,int>;
const int N=2E5+5;
const ll M=1000000000;
const ll INF_64=0x3f3f3f3f3f3f3f3f;
const int INF_32=0x3f3f3f3f;
const int16_t INF_16=0x3f3f;
const int klog=20;
const int mod=1E9+7;
const double eps=1E-8;
void gen(){

}
void sol(){
    int n;cin>>n;n*=2;
    vector<int> a(n);
    F(i,n) cin>>a[i];
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    sort(ALL(ord),[&](int i,int j){return a[i]<a[j];});
    vector<int> b(n);
    F(i,n) b[ord[i]]=(i<n/2)?1:0;
    string res(n, ' ');
    vector<int> st;
    F(i,n){
        if(!st.empty()&&b[i]!=b[st.back()]){
            res[st.back()] = '(';
            res[i] = ')';
            st.pop_back();
        }
        else {
            st.push_back(i);
        }
  }
  cout <<res<< '\n';
}
int32_t main(){
    #ifdef LOCAL
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    #endif // LOCAL
    #ifndef LOCAL
    #endif // LOCAL
    IOS;
    int t=1;
    gen();
    //cin>>t;
    FF(i,1,t+1){
        //cout<<"Case #"<<i<<": ";
        sol();
    }
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll t;
cin>>t;
while(t--){
  ll x;
  cin>>x;
  if(x%2==1){
    cout<<"Odd"<<'\n';
    continue;
    }
  if(x>=4 && x%4==0){
    cout<<"Even"<<'\n';
    continue;
   }
  if(x%2==0){
    cout<<"Same"<<'\n';
    continue;
    }
    
    
  
}
}