#include <bits/stdc++.h>
using namespace std;
#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#endif
int main() {
  ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
  int n;
  cin >> n;
  n = min(n, 8);
  vector<int> a(n);
  for (auto& ai : a) {
    cin >> ai;
  }
  vector<int> f(200, -1);
  for (int mask = 1; mask < (1 << n); ++mask) {
    int64_t sum = 0;
    for (int bit = 0; bit < n; ++bit) {
      if (mask & (1 << bit)) {
        sum += a[bit];
      }
    }
    sum %= 200;
    if (f[sum] != -1) {
      auto print_mask = [&] (int mask) -> void {
        cout << __builtin_popcount(mask) << " ";
        for (int bit = 0; bit < n; ++bit) {
          if (mask & (1 << bit)) {
            cout << bit + 1 << " ";
          }
        }
        cout << "\n";
      };
      cout << "Yes\n";
      print_mask(f[sum]);
      print_mask(mask);
      return 0;
    } else {
      f[sum] = mask;
    }
  }
  cout << "No\n";
  return 0;
}
#include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
#include <algorithm>

// URL: 

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;

#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n)? "YES": "NO") << endl
#define Yes(n) cout << ((n)? "Yes": "No") << endl

#define FOR(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fore(x, a) for(auto& (x) : (a))

#define FORL(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define repll(i, n) for (ll i = 0; i < (ll)(n); i++)

#define ALL(a) (a).begin(), (a).end()

#define VECCIN(x) for(auto& youso_: (x)) cin >> youso_
#define VECCOUT(x) for(auto& youso_: (x)) cout << youso_ << " ";cout << endl

#define pb push_back
#define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

const ll INFL = 1e18;
const int INF = 1e9;
const int MOD = 1e9 + 7;

int main(){
  ll T;
  cin >> T;
  repll(i,T) {
    ll N;
    cin >> N;
    if (N % 2 == 1) {
      cout << "Odd" << endl;
    }
    else {
      N /= 2;
      if (N % 2 == 1) {
        cout << "Same" << endl;
      }
      else {
        cout << "Even" << endl;
      }
    }
  }
} 