
/*
			Saturday 08 May 2021 05:51:43 PM IST
					@uthor::astrainL3gi0N
*/

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

typedef long long int ll;
typedef std::vector<int> vi;
typedef std::pair<int,int> ii;
typedef std::vector<ii> vii;
typedef std::vector<ll> vl;

#define pb push_back
#define mp make_pair
#define debg(x)	std::cerr<<(#x)<<" => "<<x<<'\n';
#define debgg(x,y)	std::cerr<<(#x)<<" => "<<x<<'\t'<<(#y)<<' '<<y<<'\n';
#define len(a) (int)(a).size()
#define all(x) x.begin(),x.end()

const int mod = 200;
const int modd = 998244353;
const int esc = -1;
const string ys = "Yes\n";
const string no = "No\n";

bool comp (int x, int y) {
    return x > y;
}
void printarr (int arr[], int n) {
    for(int i = 0; i < n; ++i)
        cout<<arr[i]<<(i<n-1?' ':'\n');
}
template < typename T> void  printv (T &a) {
    for (auto it = a.begin(); it != a.end(); ++it)
        cout<<*it<<' ';
    cout<<'\n';
}
int gint() {
    int n;  cin>>n;
    return n;
}
//int t[510][510];
ll ans;

void solve () {
    map <int,int> freq;
    set <int> hsh;
    ans = 0;
    bool ok = false;
    int n = gint();
    vi arr(100,0);
    for (int i = 0; i < n;++i) {
        arr[i] = gint()%200;
    }
    int res = 0;
	for (int b = 1; b < (1<<(min(10,n))); ++b) {
	    ans = 0;
	    ok = 1;
		for (int i = 0;i < min(n,30); ++i) {
			if (b & (1<<i))	{
			    ans += arr[i];
			    ans %= mod;
            }
		}
		if (ok)
		if (freq[ans]) {
		    res = b;
		    break;
        }
        freq[ans] = b;
    }
    vi rs1,rs2;


    cout<<(res?"YES":"NO");
    cout<<'\n';
    if (res) {
        int temp = freq[ans];
		for (int i = 0; i < 10; ++i) {
			if (res & (1<<i))	{
			    rs1.pb(i+1);
            }
			if (temp & (1<<i))	{
			    rs2.pb(i+1);
            }
		}
		cout<<len(rs1)<<' ';
		printv(rs1);
		cout<<len(rs2)<<' ';
		printv(rs2);

    }
}
void sol () {
    //test
}

int main () {
    std::ios_base::sync_with_stdio(false);std::cin.tie(nullptr);

    //cout << setprecision(15) << fixed;
    int testcases = 1;  
    for (int t = 0; t < testcases; ++t) {
        //cout<<"Case #"<<t+1<<": ";
        solve();
    }

    return 0;
}

/*#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(firstsecond) '(' << first< ',' << second< ')'
//constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;
constexpr ll MOD = 3;
ll INF = 1001001001001001001;
long double EPS = 1e-8;
long double PI = 3.141592653589793238;
template <typename T>
void remove(std::vector<T> &vector, unsigned int index)
{
   vector.erase(vector.begin() + index);
}


random_device seed_gen;
mt19937_64 rnd(seed_gen());
 
ll range_rand(ll a,ll b){
    uniform_int_distribution<ll> dist_res(a,b);
    return dist_res(rnd);
}
 

using Graph = vector<vector<ll>>;


// MOD確認

ll N;
ll A[210];
set<set<ll>> dp[210][210];

int main(){
   cin >> N;
   rep(i,N) cin >> A[i];
   set<ll> sstt;
   dp[0][0].insert(sstt);
   rep(i,N){
      rep(j,200){
         for(auto itr = dp[i][j].begin();itr != dp[i][j].end();itr++){
            if(dp[i+1][(A[i]+j) % 200].size() >= 3 && dp[i+1][j].size() >= 2) break;
            set<ll> st = *itr;
            st.insert(i);
            dp[i+1][(A[i]+j) % 200].insert(st);
            dp[i+1][j].insert(*itr);
         }
      }
   }
   rep(i,200){
      if(dp[N][i].size() >= 2){
         set<ll> st1,st2,st;
         ll cnt = 0;
         ll n = dp[N][i].size();
         for(auto itr = dp[N][i].begin();itr != dp[N][i].end();itr++){
            st = *itr;
            cnt++;
            if(st.size() != 0 && cnt != n){
               st1 = *itr;
               itr++;
               st2 = *itr;
               break;
            }
         }
         if(st1.size() != 0){
            cout << "Yes" << endl;
         }else{
            continue;
         }
         if(st1 == st2) continue;
         cout << st1.size() << ' ';
         for(auto itr = st1.begin();itr != st1.end();itr++){
            cout << *itr + 1 << ' ';
         }
         cout << endl;
         cout << st2.size() << ' ';
         for(auto itr = st2.begin();itr != st2.end();itr++){
            cout << *itr + 1 << ' ';
         }
         cout << endl;
         return 0;
      }
   }
   cout << "No" << endl;
}