#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()

typedef long long ll;
typedef pair<ll, ll> P;

const int mod =  1000000007;  //出力は (ans % mod + mod) % mod  (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60;

int main()
{
    int n; cin >> n;
    int a[n];
    int lim = 0;
    rep(i,n){
        cin >> a[i];
        lim = max(lim,a[i]);
    }
    int cnt = 0;
    int ans = 0;
    for(int i = 2; i <= lim; i++){
        int tmp_cnt = 0;
        for(int j = 0; j < n; j++){
            if(a[j] % i == 0) tmp_cnt++;
        }
        if(cnt < tmp_cnt){
            cnt = tmp_cnt;
            ans = i;
        }
    }
    cout << ans << endl;
}

//#pragma GCC optimize ("O2")
//#pragma GCC optimize ("Ofast")
// IN THE NAME OF GOD
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;

template <typename Head>
inline void dout(Head in) {
  cerr << in << '\n';
} 

int main() {
  ios::sync_with_stdio(false), cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    if (n % 2 == 0) {
      if (n % 4 == 0) {
        cout << "Even\n";
      }
      else {
        cout << "Same\n";
      }
    }
    else {
      cout << "Odd\n";
    }
  } 
  return 0;
}