#include <bits/stdc++.h>
using namespace std;
const double PI  = acos(-1.0);
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define print(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; 
int main()
{

    int A, B;
    cin >> A >> B;
    cout << (A + B)/2 << " ";
    cout << (A - B)/2;
    return 0;
}


#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
//priority_queue<ll, vector<ll>, greater<ll>> Q;
/*
1 = 1
2 = 1,2
3= 1,3
4 = 1,2,4
5 = 1,5
6=1,2,3,6
10^18まで
NlogN
10^9までになっちゃう

8 = 1,2,4,8 = 2^3
10 = 2,5 2とそれ以外の組み合わせが偶数個数
36 = 2,2,3,3= {2,2}{1,3,3}
*/
int main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  
  ll T;
  cin >> T;
  rep(i, T){
    ll N;
    cin >> N;
    ll two = 0;
    while (N%2 == 0){
      N/= 2;
      two++;
    }
  if (two == 1)
    cout << "Same" << endl;
  else if (two == 0)
    cout << "Odd" << endl;
  else
    cout << "Even" << endl;
  }
}
