#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 1e5 + 5;
int n;
int p[mx];
int edge[mx];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  memset(edge, -1, sizeof(edge));
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> p[i];
  int source = -1;
  for (int i = 1; i <= n; ++i) {
    if (i == p[i]) {
      source = i;
      break;
    }
    if (i == p[p[i]]) {
      source = i;
    }
  }
  if (source == -1) {
    cout << "NO" << '\n';
    return 0;
  }
  for (int i = 1; i <= n; ++i) {
    if (i == source) continue;
    if (edge[i] != -1) continue;
    edge[i] = source;
    int u = source, v = i;
    u = p[u], v = p[v];
    if (u == i) continue;
    while (1) {
      if (edge[v] == -1)
        edge[v] = u;
      else if (edge[v] == u)
        break;
      else {
        cout << "NO" << '\n';
        ;
        return 0;
      }
      u = p[u], v = p[v];
    }
  }
  cout << "YES" << '\n';
  ;
  for (int i = 1; i <= n; ++i) {
    if (edge[i] != -1) cout << i << " " << edge[i] << '\n';
  }
}
