#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define rep2(i,n) for (int i=0; i<(n)-1; i++)
using ll = long long;
using P = pair<int,int>;
int main() {
  int t; cin >> t;
  rep(i,t) {
    ll n; cin >> n;
    if(n%4 == 0) cout << "Even" << endl;
    else if(n%4 == 2) cout << "Same" << endl;
    else cout << "Odd" << endl;
  }
}
#define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<climits>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<list>
#include<functional>


using namespace std;

#define MAX(A,B) ((A)>(B)?(A):(B))
#define MIN(A,B) ((A)<(B)?(A):(B))
#define LP(I,S,G) for (long long int I = S; I < G; I++)
#define IN(X) 	for (int i = 0; i < X.size(); i++)cin >> X[i]
#define OUT(X) 	for (int i = 0; i < X.size(); i++)cout << X[i]<<" "
#define SORT(X) sort(X.begin(), X.end())
#define CSORT(X,Y) sort(X.begin(), X.end(),Y)
#define COPY(X,Y) copy(X.begin(), X.end(), Y.begin())
#define ALL(X,Y) for (auto X = Y.begin(); X != Y.end(); X++)

template<class I1, class I2>
istream& operator>>(istream& s, pair<I1, I2>& in) {
	s >> in.first >> in.second;
	return s;
}

long long int M = pow(10, 9) + 7;




int main(void) {
	string s;
	cin >> s;
	stack<char> ans;
	LP(i, 0, s.size()) {
		switch (s[i]) {
		case '0':
			ans.push('0');
			break;
		case '1':
			ans.push('1');
			break;
		case '6':
			ans.push('9');
			break;
		case '8':
			ans.push('8');
			break;
		case '9':
			ans.push('6');
		}
	}

	while (ans.size() != 0) {
		cout << ans.top();
		ans.pop();
	}
	return 0;
}