#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int t;
  cin >> t;
  while (t--) {
    ll n;
    cin >> n;
    n %= 4;
    if (n == 1 || n == 3) {
      cout << "Odd" << endl;
    } else if (n == 2) {
      cout << "Same" << endl;
    } else {
      cout << "Even" << endl;
    }
  }
  return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const ll MM = 1000000007;
const ll INF = 1e18;
const long double PI = acos(-1.0);
//------------------------------------------//

int main(){
    int M,H;cin >> M >> H;
    if(H%M==0){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
    }
    return 0;
}