#include<bits/stdc++.h>
using namespace std;
 
typedef long long LL;         
typedef pair<int, int> P;
 
const int maxn = 200 + 10;        
const int M_MAX = 10;
const int mod = 1e9 + 7;
const LL INF = 0x3f3f3f3f;    
const double eps = 1e-6;      

int n;
int arr[maxn];
vector<int> ans[300];

void out(vector<int> &t) {
    cout << t.size();
    for(auto i : t) {
        cout << " " << i;
    }
    cout << endl;
}

void solve() {
    cin >> n;
    for(int i = 0; i < n; i++) cin >> arr[i];
    int cnt = min(n, 8);
    for(int i = 0; i < 1 << cnt; i++) {
        LL sum = 0;
        vector<int> s;
        for(int j = 0; j < cnt; j++) {
            if(1 << j & i) {
                s.emplace_back(j + 1);
                sum += arr[j];
            }
        }
        sum %= 200;
        if(!ans[sum].empty()) {
            cout << "YES\n";
            out(ans[sum]);
            out(s);
            return ;
        }
        else {
            ans[sum] = s;
        }
    }
    cout << "NO\n";
}
 
int main() {
    ios::sync_with_stdio(false);
    //srand(time(NULL));    //更新种子
    solve();
    return 0;
}  
#include <bits/stdc++.h>

#define ll long long
#define ld long double
using namespace std;

const int N = 205;

int n, dp[N][N][N][2][2], a[N];
vector<int> b, c;


int add(int a, int b){
    return (a + b) % 200;
}

int solve(int idx, int m1, int m2, int t, int t2){
    if(idx == n){
        return m1 == m2 && t && t2;
    }
    if(dp[idx][m1][m2][t][t2] != -1) return dp[idx][m1][m2][t][t2];

    int op1 = solve(idx + 1, m1, m2, t, t2);
    int op2 = solve(idx + 1, add(m1, a[idx]), m2, 1, t2);
    int op3 = solve(idx + 1, m1, add(m2, a[idx]), t, 1);

    return dp[idx][m1][m2][t][t2] = (op1 | op2 | op3);
}

void build(int idx, int m1, int m2, int t, int t2){
    if(idx == n){
        return;
    }
    int op1 = solve(idx + 1, m1, m2, t, t2);
    int op2 = solve(idx + 1, add(m1, a[idx]), m2, 1, t2);
    int op3 = solve(idx + 1, m1, add(m2, a[idx]), t, 1);
    if(op1){
        build(idx + 1, m1, m2, t, t2);
    }
    else if(op2){
        b.push_back(idx + 1);
        build(idx + 1, add(m1, a[idx]), m2, 1, t2);
    }
    else {
        c.push_back(idx + 1);
        build(idx + 1, m1, add(m2, a[idx]), t, 1);
    }

}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    memset(dp, -1, sizeof dp);
    if(solve(0, 0, 0, 0, 0)){
        cout << "Yes" << '\n';
        build(0, 0, 0, 0, 0);
        cout << (int) b.size() << ' ';
        for(auto i: b){
            cout << i << ' ';
        }
        cout << '\n';
        cout << (int) c.size() << ' ';
        for(auto i: c) cout << i << ' ';
    }
    else cout << "No";


    return 0;
}

