#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T bpow(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int f[2009];
vector<int> a[2009];
int main() {
  int cs = 1, t, i, j, n, p, q, r, k;
  t = 0;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &j);
    a[j].push_back(i + 1);
    if (t != 3 && a[j].size() >= 3) {
      t = 3;
      r = j;
    }
    if (t == 0) {
      if (a[j].size() == 2) {
        p = j;
        t = 1;
      }
    } else if (t == 1) {
      if (a[j].size() == 2) {
        t = 2;
        q = j;
      }
    }
  }
  if (t < 2)
    printf("NO");
  else if (t == 2) {
    printf("YES\n");
    k = 1;
    for (i = 1; i <= 2000 && k <= n; i++) {
      for (j = 0; j < a[i].size(); j++) {
        printf("%d%c", a[i][j], (k != n) ? ' ' : '\n');
        k++;
      }
    }
    k = 1;
    for (i = 1; i <= 2000 && k <= n; i++) {
      if (p == i) {
        for (j = a[i].size() - 1; j > -1; j--) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
      } else {
        for (j = 0; j < a[i].size(); j++) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
      }
    }
    k = 1;
    for (i = 1; i <= 2000 && k <= n; i++) {
      if (q == i) {
        for (j = a[i].size() - 1; j > -1; j--) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
      } else {
        for (j = 0; j < a[i].size(); j++) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
      }
    }
  } else {
    printf("YES\n");
    k = 1;
    for (i = 1; i <= 2000 && k <= n; i++) {
      for (j = 0; j < a[i].size(); j++) {
        printf("%d%c", a[i][j], k != n ? ' ' : '\n');
        k++;
      }
    }
    k = 1;
    for (i = 1; i <= 2000 && k <= n; i++) {
      if (r == i) {
        for (j = a[i].size() - 1; j > -1; j--) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
      } else {
        for (j = 0; j < a[i].size(); j++) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
      }
    }
    k = 1;
    for (i = 1; i <= 2000 && k <= n; i++) {
      if (r == i) {
        for (j = 1; j < a[i].size(); j++) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
        printf("%d%c", a[i][0], k != n ? ' ' : '\n');
        k++;
      } else {
        for (j = 0; j < a[i].size(); j++) {
          printf("%d%c", a[i][j], k != n ? ' ' : '\n');
          k++;
        }
      }
    }
  }
  return 0;
}
