#include <math.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;

int main() {
  ll N;
  cin >> N;
  ll ans = 0;
  ll x = 1000;
  if (N >= x) {
    ans += N - x + 1;
  }
  x *= 1000;
  if (N >= x) {
    ans += N - x + 1;
  }
  x *= 1000;
  if (N >= x) {
    ans += N - x + 1;
  }
  x *= 1000;
  if (N >= x) {
    ans += N - x + 1;
  }
  x *= 1000;
  if (N >= x) {
    ans += N - x + 1;
  }
  x *= 1000;

  cout << ans << endl;

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

#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>

#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>

constexpr ll INF = (1ll << 60);
constexpr ll mod = 1000000007;
constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
ll mypow(ll a, ll n) {
    ll ret = 1;
    rep(i, n) {
        if (ret > (ll)(1e18 + 10) / a) return -1;
        ret *= a;
    }
    return ret;
}
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main(){
    ll t;
    cin >> t;
    vector<string> ans(t);
    rep(i, t){
        ll n;
        cin >> n;
        if(n%4==0)ans[i]="Even";
        else if(n%2==0)ans[i]="Same";
        else ans[i]="Odd";
    }
    rep(i, t)cout << ans[i] << endl;
    return 0;
}