#include <bits/stdc++.h>
#define F first
#define S second
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define RFOR(i, a, b) for(int i = a; i >= b; i--)
#define all(v) ((v).begin()), ((v).end())
#define endl '\n'

using namespace std;
using ll     = long long;
using ull    = unsigned long long;
using Graph  = vector<vector<int>>;
using pii    = pair<int, int>;
using pll    = pair<ll, ll>;
using vi     = vector<int>;
using vll    = vector<ll>;
using vpii   = vector<pii>;
using vpll   = vector<pll>;
#ifdef __SIZEOF_INT128__
using Bigint = __int128;
#endif

template <class T, class U>
void max_self(T& t, const U& u) {
    if (t > u) t = u;
}

template <class T, class U>
void min_self(T& t, const U& u) {
    if (t < u) t = u;
}

template <typename T>
void print(const T& cont) {
  cout << "{";
  int idx = 0;
  for (auto& itr : cont) {
      if (idx++) cout << ",";
      cout << itr;
  }
  cout << "}\n";
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    FOR (i, 0, v.size() - 1) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

string solve(ll& n)
{
  if (n % 4 == 0) return "Even\n";
  if (n % 2 == 0) return "Same\n";
  return "Odd\n";
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

  int t;
  cin >> t;
  while (t--) 
  {
    ll n;
    cin >> n;
    cout << solve(n);
  }
}
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ll t,n;
    cin>>t;
    while(t--)
    {
        cin>>n;
        if(n%2==1)
            cout<<"Odd"<<endl;
        else
        {
            ll r=0 ;
            while(n%2==0)
            {
                ++r;
                n=n/2;
            }
            ++r;
            if(r>=3)
                cout<<"Even"<<endl;
            else
                cout<<"Same"<<endl;
        }
    }
}
