Problem: 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, a[2005] = {0}, flag = 0, b[2005], c[2005][2], n, count = 0,
            count1 = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> b[i];
    a[b[i]]++;
    c[i][0] = b[i];
    c[i][1] = i + 1;
  }
  for (i = 0; i < n; i++) {
    for (j = i; j < n; j++) {
      if (c[i][0] > c[j][0]) {
        swap(c[i][0], c[j][0]);
        swap(c[i][1], c[j][1]);
      }
    }
  }
  for (i = 0; i < 2002; i++) {
    if (a[i] >= 2) {
      if (a[i] == 2) {
        count++;
      } else if (a[i] > 2) {
        count1++;
      }
    }
  }
  if (count >= 2) {
    printf("YES\n");
    for (i = 0; i < n; i++) {
      printf("%d ", c[i][1]);
    }
    printf("\n");
    for (i = 1; i < n; i++) {
      if (c[i][0] == c[i - 1][0]) {
        swap(c[i][1], c[i - 1][1]);
        break;
      }
    }
    for (j = 0; j < n; j++) {
      printf("%d ", c[j][1]);
    }
    printf("\n");
    for (i = i + 1; i < n; i++) {
      if (c[i][0] == c[i - 1][0]) {
        swap(c[i][1], c[i - 1][1]);
        break;
      }
    }
    for (j = 0; j < n; j++) {
      printf("%d ", c[j][1]);
    }
  } else if (count1 >= 1) {
    printf("YES\n");
    for (i = 0; i < n; i++) {
      printf("%d ", c[i][1]);
    }
    printf("\n");
    for (i = 1; i < n; i++) {
      if (c[i][0] == c[i - 1][0]) {
        swap(c[i][1], c[i - 1][1]);
        break;
      }
    }
    for (j = 0; j < n; j++) {
      printf("%d ", c[j][1]);
    }
    printf("\n");
    for (i = i + 1; i < n; i++) {
      if (c[i][0] == c[i - 1][0]) {
        swap(c[i][1], c[i - 1][1]);
        break;
      }
    }
    for (j = 0; j < n; j++) {
      printf("%d ", c[j][1]);
    }
  } else {
    printf("NO");
  }
  return 0;
}