#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using int64 = long long;

void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}

struct ranges {
  int l, r, sum;
};

bool disjoint(pair<int,int> p1, pair<int,int> p2) {
  if (p1.first > p2.first)
    swap(p1, p2);
  return p1.second < p2.first;
}

bool disjoint(ranges p1, ranges p2) {
  if (p1.l > p2.l)
    swap(p1, p2);
  return p1.r < p2.l;
}

bool consec(pair<int,int> p1, pair<int,int> p2) {
  if (p1.first > p2.first)
    swap(p1, p2);
  return p1.second == p2.first - 1;
}

bool consec(ranges p1, ranges p2) {
  if (p1.l > p2.l)
    swap(p1, p2);
  return p1.r == p2.l - 1;
}

void test_case() {
  int N;
  cin >> N;
  vector<int> a(N + 1);
  vector<ranges> r;
  for (int i = 1; i <= N; ++i) {
    cin >> a[i];
    if (a[i] >= 200)
      a[i] %= 200;
    int sum = 0;
    for (int j = i; j > 0; --j) {
      sum += a[j];
      if (sum >= 200)
        sum -= 200;
      r.push_back({j, i, sum});
    }
  }
  vector<vector<pair<int,int>>> ways(200);
  int M = r.size();
  for (int i = 0; i < M - 1; ++i)
    for (int j = i + 1; j < M; ++j) {
      if (r[i].sum == r[j].sum) {
        cout << "Yes\n";
        cout << r[i].r - r[i].l + 1 << ' ';
        for (int k = r[i].l; k <= r[i].r; ++k)
          cout << k << ' ';
        cout << '\n';
        cout << r[j].r - r[j].l + 1 << ' ';
        for (int k = r[j].l; k <= r[j].r; ++k)
          cout << k << ' ';
        cout << '\n';
        return;
      }
      if (!disjoint(r[i], r[j]))
        continue;
      int new_sum = r[i].sum + r[j].sum;
      if (new_sum >= 200)
        new_sum -= 200;
      if (ways[new_sum].size() == 2) {
        if (consec(ways[new_sum][0], ways[new_sum][1]) && consec(r[i], r[j])
            && min(ways[new_sum][0].first, ways[new_sum][1].first) == min(r[i].l, r[j].l)
            && max(ways[new_sum][0].second, ways[new_sum][1].second) == max(r[i].r, r[j].r))
          continue;
        cout << "Yes\n";
        set<int> ind;
        for (int k = ways[new_sum][0].first; k <= ways[new_sum][0].second; ++k)
          ind.emplace(k);
        for (int k = ways[new_sum][1].first; k <= ways[new_sum][1].second; ++k)
          ind.emplace(k);
        cout << ind.size() << ' ';
        for (int x : ind)
          cout << x << ' ';
        cout << '\n';
        ind.clear();
        for (int k = r[i].l; k <= r[i].r; ++k)
          ind.emplace(k);
        for (int k = r[j].l; k <= r[j].r; ++k)
          ind.emplace(k);
        cout << ind.size() << ' ';
        for (int x : ind)
          cout << x << ' ';
        cout << '\n';
        return;
      }
      ways[new_sum].emplace_back(r[i].l, r[i].r);
      ways[new_sum].emplace_back(r[j].l, r[j].r);
    }
  cout << "No\n";
}

void solve() {
  int T = 1;
  for (int tc = 0; tc < T; ++tc)
    test_case();
}

int main() {
  fastIO();
  solve();
  return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int N=205;
int n,a[N];
vector<int>v,res1,res2;
vector<int>save[N];
bool flag;
void dfs(int cur,int sum){
	sum%=200;
	if(flag)	return;
	if(cur==n+1){
		if(save[sum].size()&&v.size()){
			flag=true;
			res1=save[sum];
			res2=v;
		}
		else	save[sum]=v;
		return;
	}
	dfs(cur+1,sum);
	
	v.push_back(cur);
	dfs(cur+1,sum+a[cur]);
	v.pop_back();
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)	scanf("%d",&a[i]);
	dfs(1,0);
	if(flag){
		puts("Yes");
		cout<<res1.size()<<" ";
		for(int i=0;i<res1.size();i++)	cout<<res1[i]<<" ";
		puts("");
		cout<<res2.size()<<" ";
		for(int i=0;i<res2.size();i++)	cout<<res2[i]<<" ";
	}
	else	puts("No");
	return 0;
}
/*
鸽巢原理
如果n个巢里有kn+1个鸽子，那么至少有一个巢里面有kn+1个鸽子 
*/
