#include <bits/stdc++.h>
using namespace std;

void printmat(const vector<vector<int>>& mat) {
    for (auto row : mat) {
        for (int elem : row)
            cout << elem << " ";
        cout << endl;
    }
}
void printv(const vector<int>& v) {
    for (int elem : v)
        cout << elem << " ";
    cout << endl;
}
void printvp(const vector<pair<int, int>>& vp) {
    for (auto row : vp) 
        cout << row.first << ", " << row.second << " ; ";
    cout << endl;
}

static bool cmp(pair<string,int>& a, pair<string,int>& b) {
    if (a.second>b.second) return true;
    if (a.second<b.second) return false;
    return (a.first<b.first);
}


int main() {
    int T=1, caseIdx=0;
    //cin >> T;  
    while (T--) {
        caseIdx++;
        string s, scopy;
        cin >> s;
        int ans = 0;
        for (int k=0; k<10000; k++) {
            string t = to_string(k);
            while (t.length()<4)
                t.insert(t.begin(), '0');
            //cout << t << endl;
            scopy = s;
            bool bFail = false;
            for (int i=0; i<10; i++) {
                for (int j=0; j<4; j++) {
                    int pos = t[j] - '0';
                    if (scopy[pos]=='x') {
                        bFail = true;
                        break;
                    }
                    scopy[pos] = '?';
                }
                if (bFail)
                    break;
            }
            if (!bFail) {
                //cout << scopy << endl;
                for (int i=0; i<10; i++) {
                    if (scopy[i]=='o') {
                        bFail = true;
                        break;
                    }
                }
                if (!bFail)
                    ans++;
            }
        }
        cout << ans << endl;
        //cout << "Case #" << caseIdx << ": " << ans << endl;
    }
}
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define sz(s) (int)(s.size())
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(),v.end()
#define watch(x) cout<<(#x)<<" = "<<x<<endl
const int dr[] { -1, -1, 0, 1, 1, 1, 0, -1 };
const int dc[] { 0, 1, 1, 1, 0, -1, -1, -1 };
#if __cplusplus >= 201402L
template<typename T>
vector<T> create(size_t n) {
	return vector<T>(n);
}
template<typename T, typename ... Args>
auto create(size_t n, Args ... args) {
	return vector<decltype(create<T>(args...))>(n, create<T>(args...));
}
#endif
void run() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
#ifndef ONLINE_JUDGE
	freopen("input.in", "r", stdin);
#else
	//freopen("groups.in", "r", stdin);
#endif
}

void solve() {
	ll n;
	cin >> n;
	bool have = false;
	if (n % 2 == 0) {
		have = true;
		n /= 2;
	}
	if (have && n % 2)
		cout << "Same";
	else if (have)
		cout << "Even";
	else
		cout << "Odd";
	cout << endl;
}

int main() {
	run();
	int T;
	cin >> T;
	while (T--) {
		solve();
	}
}
