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

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int N;
	cin >> N;
	double ans = N;
	double tmp = 0.0;
	for (int i=1;i<=N;i++) {
		tmp += 1.0/i;
	}
	ans *= tmp;
	ans -= 1;
	cout << fixed << setprecision(15) << ans << "\n";
	return 0;
}
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>

using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
#define rprintf(fmt, begin, end) do { const auto end_rp = (end); auto it_rp = (begin); for (bool sp_rp=0; it_rp!=end_rp; ++it_rp) { if (sp_rp) putchar(' '); else sp_rp = true; printf(fmt, *it_rp); } putchar('\n'); } while(0)

int N;
int A[211];

VI B, C;
VI D[211];
VI stk;

bool rec(int I, int s) {
    if (I == N) {
	if (stk.empty()) return false;

	if (!D[s].empty()) {
	    B = D[s];
	    C = stk;
	    return true;
	}

	D[s] = stk;
	return false;
    } else {
	bool b = rec(I+1, s);
	if (b) return true;


	stk.push_back(I+1);
	b = rec(I+1, (s+A[I]) % 200);
	stk.pop_back();
	if (b) return true;

	return false;
    }
}

void MAIN() {
    scanf("%d", &N);
    REP (i, N) scanf("%d", A+i);


    if (rec(0, 0)) {
	puts("Yes");
	REP (t, 2) {
	    printf("%d ", (int)B.size());
	    rprintf("%d", B.begin(), B.end());
	    swap(B, C);
	}
    } else {
	puts("No");
    }
}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}

