#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;

pair<int, int> p(LL N) {
  set<LL> v;
  for (LL i = 1; i * i <= N; ++i) {
    if (N % i == 0) {
      v.insert(i);
      v.insert(N/i);
    }
  }
  int cnt_o = 0, cnt_e = 0;
  for (auto i : v) {
    if (i % 2 == 0) ++cnt_e;
    else            ++cnt_o;
  }
  return {cnt_o, cnt_e};
}

template<typename T1, typename T2>
ostream& operator << (ostream& os, const pair<T1, T2>& p){
  os << "{" << p.first << "," << p.second << "} ";
  return os;
}

int main() {
  int T; cin >> T;
  for (int i = 0; i < T; ++i) {
    LL c; cin >> c;
    if (c % 2 == 1) {
      cout << "Odd" << endl;
    } else {
      c /= 2;
      if (c % 2 == 1) cout << "Same" << endl;
      else            cout << "Even" << endl;
    }
  }
}

#include <bits/stdc++.h>
    
using namespace std;
using ll = long long;
    
#define debug(x) cerr << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define MSET(c, v) memset(c, v, sizeof(c))
    
const ll INF = 1e17;
const int NEGINF = 0xC0C0C0C0;
const int NULO = -1;
const double EPS = 1e-10;
const ll mod = 1e9 + 7;
    
int dx[] = {0,1,-1,0};
int dy[] = {1,0,0,-1};

const int maxn = 1e3 + 10;

void solveTestCase() {
    ll n;
    cin >> n;
    if(n & 1) {
        cout << "Odd\n";
    } else {
        if(n % 4 == 0) {
            cout << "Even\n";
        } else {
            cout << "Same\n";
        }
    }
} 


int main() {
    ios::sync_with_stdio(false);
    int test;
    
    cin >> test;
    // test = 1;
    while(test--) {
        solveTestCase();
    }
    return 0;
}
