#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define mem(a,b) memset(a,b,sizeof (a))
#define ios std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
// ios  can not be used with scanf,printf.  IF  ios MUST cin,cout.
typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> PII;
const ll mod=1000000007;
const int INF=0x3f3f3f3f;
ll ksm(ll a,ll b){ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

const int N=2e5+10,M=18;

int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        ll n;
        scanf("%lld",&n);
        if(n&1)puts("Odd");
        else if(n%4==2)puts("Same");
        else puts("Even");
    }
    return 0;
}


// Generated by 2.3.1 https://github.com/kyuridenamida/atcoder-tools

#include <bits/stdc++.h>
// #include "atcoder/all"

using namespace std;

using i64 = long long;

const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;


template <typename T>
bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}


void solve(long long n, std::vector<long long> a){
    vector<pair<i64,int>> v;
    for(int i = 0; i < 2 * n; ++i){
        v.emplace_back(a[i], i);
    }
    sort(v.begin(), v.end());
    vector<int> fl(2 * n, 0);
    for(int i = 0; i < n; ++i){
        fl[v[i].second] = true;
    }
    queue<bool> que;
    string s;
    for(int i = 0; i < 2 * n; ++i){
        if(!que.empty() && que.front() != fl[i]){
            s += ')';
            que.pop();
        }
        else{
            que.emplace(fl[i]);
            s += '(';
        }
    }
    assert(que.empty());
    cout << s << endl;
}


signed main(){
    long long N;
    std::scanf("%lld", &N);
    std::vector<long long> A(2*N);
    for(int i = 0 ; i < 2*N ; i++){
        std::scanf("%lld", &A[i]);
    }
    solve(N, std::move(A));
    return 0;
}
