MUH and Important Things （非递减排序）

题目链接：http://codeforces.com/problemset/problem/471/B

It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, they have evaluated its difficulty. Also animals decided to do the tasks in order of their difficulty. Unfortunately, some tasks can have the same difficulty, so the order in which one can perform the tasks may vary.

Menshykov, Uslada and Horace ask you to deal with this nuisance and come up with individual plans for each of them. The plan is a sequence describing the order in which an animal should do all the n tasks. Besides, each of them wants to have its own unique plan. Therefore three plans must form three different sequences. You are to find the required plans, or otherwise deliver the sad news to them by stating that it is impossible to come up with three distinct plans for the given tasks.

Input

The first line contains integer n (1 ≤ n ≤ 2000) — the number of tasks. The second line contains n integers h1, h2, ..., hn (1 ≤ hi ≤ 2000), where hi is the difficulty of the i-th task. The larger number hi is, the more difficult the i-th task is.

Output

In the first line print "YES" (without the quotes), if it is possible to come up with three distinct plans of doing the tasks. Otherwise print in the first line "NO" (without the quotes). If three desired plans do exist, print in the second line n distinct integers that represent the numbers of the tasks in the order they are done according to the first plan. In the third and fourth line print two remaining plans in the same form.

If there are multiple possible answers, you can print any of them.

Examples

Input

4
1 3 3 1

Output

YES
1 4 2 3 
4 1 2 3 
4 1 3 2 

Input

5
2 4 1 4 8

Output

NO

Note

In the first sample the difficulty of the tasks sets one limit: tasks 1 and 4 must be done before tasks 2 and 3. That gives the total of four possible sequences of doing tasks : [1, 4, 2, 3], [4, 1, 2, 3], [1, 4, 3, 2], [4, 1, 3, 2]. You can print any three of them in the answer.

In the second sample there are only two sequences of tasks that meet the conditions — [3, 1, 2, 4, 5] and [3, 1, 4, 2, 5]. Consequently, it is impossible to make three distinct sequences of tasks.

题意：n个问题。每一个问题都有相应的难度，求至少三个不同的序列使得做题的难度是非递减的

思路：如果某一个hi出现大于等于3次，那么可以；如果某两个不同的h值hi,hj都出现大于等于2次，那么也可以。否则不可以

可以的话，就把hi相等的交换位置就OK了

#include<cstdio>
#include<algorithm>
using namespace std;
struct node {
	int id,hi;
} a[2005];
int b[2005];
bool cmp(node a,node b) {
	return a.hi<b.hi;
}
int main() {
	int n;
	scanf("%d",&n);
	int flag2=0,flag3=0;
	for(int i=1; i<=n; i++) {
		scanf("%d",&a[i].hi);
		a[i].id=i;
		b[a[i].hi]++;
	}
	for(int i=1; i<=2000; i++) {
		if(b[i]>=3) {
			flag3++;
			break;
		}
		if(b[i]>=2) {
			flag2++;
			if(flag2>=2)
				break;
		}
	}
	sort(a+1,a+1+n,cmp);
	if(flag3>0||flag2>=2) {
		printf("YES\n");
		for(int i=1; i<=n; i++) {
			printf("%d%c",a[i].id," \n"[i==n]);
		}
		int cnt=0;
		for(int i=1; i<n; i++) {
			if(a[i].hi==a[i+1].hi) {
				swap(a[i],a[i+1]);
				for(int j=1; j<=n; j++) {
					printf("%d%c",a[j].id," \n"[j==n]);
				}
				cnt++;
			}
			if(cnt==2) break;
		}
	} else {
		printf("NO\n");
	}
	return 0;
}