#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
#define oss ostringstream
#define db double
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repn(i,a,b)   for(ll i=a;i>=b;i--)
#define F first
#define S second
#define qi queue<ll>
#define pii pair<ll,ll>
#define vi vector<ll>
#define si set<ll>
#define vii vector<pii>
#define mi multiset<ll>
#define mii multiset<pii>
#define MI map<ll,ll>
#define pb push_back
#define mp  make_pair
#define lb lower_bound
#define ub upper_bound
#define vin(a,n) vi a(n); rep(k,0,n) {cin>>a[k];}
#define vout(a) rep(k,0,a.size()) {cout<<a[k]<<" ";} cout<<"\n";
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
#define mod 998244353
#define mod2 998244353
#define inf LLONG_MAX
 
const ll N=1e9+7;
 
ll fexp(ll a, ll b){ll ans = 1;while(b){if(b&1) ans = ans*a; b/=2;a=a*a;}return ans;}
ll inverse(ll a, ll p){return fexp(a, p-2);}


signed main(){
    IOS
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    ll l;
    cin>>l;
    rep(i,0,l){
        ll n;
        cin>>n;
        if(n&1) cout<<"Odd\n";
      	else{
            if((n/2)&1)cout<<"Same\n";
            else cout<<"Even\n";
        }
    }
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define ll long long








int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    // #endif

    ll test_case=1;   //cin>>test_case;

    while(test_case--)
    {
        // cout << "Case #" << i << ": ";
        ll x;
        cin>>x;
        if(x%100==0)
        {
            cout<<100<<"\n";
            continue;
        }
        ll yy=x/100;
        yy++;
        cout<<100*yy-x<<"\n";

        






























        //Case_Ends_Here :)
    }
}
