#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define read freopen("in.txt", "r", stdin)
#define write freopen("out.txt", "w", stdout)
#define mem(x, n) memset(x, n, sizeof(x))
#define all(x) x.begin(), x.end()
#define endl "\n"
 
ll dp[65][2], n;
 
string a[65];
 
ll solve(int curr, bool prevSign)
{
	if (curr == n)
	{
		return prevSign;
	}
 
	if (dp[curr][prevSign] != -1)
		return dp[curr][prevSign];
 
	ll ans = 0;
 
	if (a[curr] == "AND")
		ans = solve(curr + 1, prevSign & true) + solve(curr + 1, prevSign & false);
	else
		ans = solve(curr + 1, prevSign | true) + solve(curr + 1, prevSign | false);
	return dp[curr][prevSign] = ans;
}
 
int main()
{
	faster;
	mem(dp, -1);
 
	cin >> n;
 
	for (int i = 0; i < n; i++)
		cin >> a[i];
 
	cout << solve(0, 0) + solve(0, 1) << endl;
 
	return 0;
}
#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
string char_to_string(char val) {
  return string(1, val);
}
int char_to_int(char val) {
  return val - '0';
}
char inverse_char(char c) {
  if(isupper(c)) return tolower(c);
  else return toupper(c);
}
template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
struct edge {
  ll to, cost;
};

int main() {
  ll T; cin >> T;
  REP(i, T) {
    ll N; cin >> N;
    if(N % 4 == 0) cout << "Even" << endl;
    else if(N % 2 == 0) cout << "Same" << endl;
    else cout << "Odd" << endl;
  }
}