#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <utility>
#include <numeric>
#define pb push_back
#define mk make_pair
#define endl "\n"
#define mod 1000000007
#define mod1 1610612741
#define mul 31
#define PI 3.14159265358979323846264
//#include bits/stdc++.h
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
typedef long long int lli;
typedef long double ld;
typedef pair<lli,lli> ii;
//priority_queue <lli, vector<lli>, greater<lli> > ti;
//priority_queue<pair<lli,pair<lli,lli>>>e;
vector <lli> p[300005],q[300005],f(200005,-1),d(300005,0),a(300005);
//vector<set<lli>>s(200005);
//set<pair<lli,lli>>s;
//vector<vector<lli>> dp(200005,vector<lli>(25,0));
//vector<lli>f(10000005);
//lli b[1000005],l[1000005];
//vector<vector<lli>> d(300005,vector<lli>(18,0));
//vector<pair<lli,ii>>p[300005];
//map<pair<lli,lli>,lli>mp,np;
//vector<pair<pair<lli, lli>,lli> > st;
//queue<lli> qy;
//freopen("codecoder.in", "r", stdin);
//freopen("codecoder.out", "w", stdout);
lli gcd(lli a, lli b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
      
}
lli bpow(lli a, lli b) {
    lli res = 1;
    while (b > 0) {
        if (b & 1)
            res = (res * a)%mod;
        a = (a * a)%mod;
        b >>= 1;
    }
    return res%mod;
}
void fact(lli i)
{
    f[0]=1;
    for(lli k=1;k<=i;k++)
    {
        (f[k]=f[k-1]*k)%=mod;
    }
}
lli isprime(lli n)
{
    if(n==1)
        return 0;
    for(lli i=2;i<=sqrt(n);i++)
        if(n%i==0)
            return 0;
    return 1;
}
lli find(lli x)
{
    if(f[x]==x)
        return x;
    else
        return f[x]=find(f[x]);
}
bool cmp(lli x,lli y)
{
    return x<y;
}
void check()
{
    cout<<"HI"<<endl;
}
lli comb(lli i,lli j)
{
    if(j>i)return 0;
    lli k=f[i];
    lli g=(f[j]*(f[i-j]))%mod;
    lli h=bpow(g,mod-2);
    return (k*h)%mod;
}
pair<ld,ld>az(ld a,ld b,ld c,ld d,ld u)
{
    ld x1=(a-c)*cos(u)-(b-d)*sin(u)+c;
    ld y1=(a-c)*sin(u)+(b-d)*cos(u)+d;
    return {x1,y1};
}
/*void sieve()
{
    for(lli i=2;i<=sqrt(10000000);i++)
    {
        if(b[i]==0)
        {
            k.pb(i);
        for(lli j=2;i*j<=sqrt(10000000);j++)
        {
            b[i*j]=1;
        }
        }
    }
}*/
int main ()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    lli t;t=1;
    while(t--)
    {
        lli n;cin>>n;
        vector<lli> a(n);
        for(lli i=0;i<n;i++)
            cin>>a[i];
        lli cnt=min(8ll,n);
        vector<vector<lli>> b(200,vector<lli>(0));
        for(lli i=1;i<(1ll<<cnt);i++)
        {
            vector<lli>v;
            lli s=0;
            for(lli j=0;j<cnt;j++)
            {
                if(i&(1ll<<j))
                {
                    v.pb(j+1);
                    (s+=a[j])%=200;
                }
            }
            if(b[s].size()!=0)
            {
                cout<<"Yes"<<endl;
                cout<<b[s].size()<<" ";
                for(lli j=0;j<b[s].size();j++)
                {
                    cout<<b[s][j]<<" ";
                }
                cout<<endl;
                cout<<v.size()<<" ";
                for(lli j=0;j<v.size();j++)
                {
                    cout<<v[j]<<" ";
                }
                cout<<endl;
                return 0;
            }
            else
            {
                b[s]=v;
            }
        }
        cout<<"No"<<endl;
    }
}

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
 
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
 
using ll = long long;
//using mint = modint;
 
const vector<int> dx = {1, 1,  1, 0,  0, 0, -1, -1, -1};
const vector<int> dy = {1, 0, -1, 1, -1, 0,  1,  0, -1};
const double PI = 3.141592653589793;
const ll inf = 1001001001;
const ll e9  = 1000000000;
const ll mod = 1000000007;
const ll mod2 = 998244353;
 
const int MAX = 1000000;
const ll MOD = 998244353;
const ll big = 1ll<<60;
 
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
 
int main(){
    ll n;
    cin >> n;
    vector<ll>a(n+10);
    vector<queue<ll>>v(210);
    vector<vector<bool>>seen(n+10, vector<bool>(210, false));
    rep(i, 0, n){
        cin >> a[i+1];
        a[i+1] %= 200;
        if(a[i+1]==0){
            seen[i+1][200] = true;
        }
    }
    rep(i, 0, n+5){
        seen[i][0] = true;
    }
    lrep(i, 1, n+1){
        lrep(j, 0, 201){
            if(seen[i-1][j] && v[(j+a[i])%200].empty()){
                //queue<ll> temp = v[j];
                v[(j+a[i])%200] = v[j];
                v[(j+a[i])%200].push(i);
                seen[i][(j+a[i])%200] = true;
                seen[i][j] = true;
            }else if(seen[i-1][j] && !v[(j+a[i])%200].empty()){
                queue<ll> temp1 = v[j];
                queue<ll> temp2 = v[(j+a[i])%200];
                temp1.push(i);
                if(temp1==temp2)continue;
                cout << "Yes" << endl;
                cout << temp1.size() << " ";
                while(!temp1.empty()){
                    cout << temp1.front() << " ";
                    temp1.pop();
                }
                cout << endl;

                cout << temp2.size() << " ";
                while(!temp2.empty()){
                    cout << temp2.front() << " ";
                    temp2.pop();
                }
                return 0;
            }
        }
    }
    cout << "No" << endl;
    return 0;
}