#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long int year) {
  return (year % 400 == 0) | (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long int &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long int modMul(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long int modAdd(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long int modSub(long long int a, long long int b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long int modPow(long long int b, long long int p) {
  long long int r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long int modInverse(long long int a) {
  return modPow(a, 1000000007 - 2);
}
inline long long int modDiv(long long int a, long long int b) {
  return modMul(a, modInverse(b));
}
inline bool isInside(pair<int, int> p, long long int n, long long int m) {
  return (p.first >= 0 && p.first < n && p.second >= 0 && p.second < m);
}
inline bool isInside(pair<int, int> p, long long int n) {
  return (p.first >= 0 && p.first < n && p.second >= 0 && p.second < n);
}
inline bool isSquare(long long int x) {
  long long int s = sqrt(x);
  return (s * s == x);
}
inline bool isFib(long long int x) {
  return isSquare(5 * x * x + 4) || isSquare(5 * x * x - 4);
}
inline bool isPowerOfTwo(long long int x) {
  return ((1LL << (long long int)log2(x)) == x);
}
struct func {
  bool operator()(pair<int, int> const &a, pair<int, int> const &b) {
    if (a.first == b.first) return (a.second < b.second);
    return (a.first < b.first);
  }
};
const long long int INF = 0x3f3f3f3f3f3f3f3f;
const long double EPS = 1e-9;
const int inf = 0x3f3f3f3f;
const int mx = (int)1e5 + 9;
struct Point {
  long long int s, p, x, y;
  string name;
  bool operator<(const Point &ob) const {
    return s == ob.s ? p < ob.p : s > ob.s;
  }
};
double distance(Point a, Point b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
long long int n, m, a, b, i, j, d, t, cs = 0, counT = 0, k, ans = 0, l = 0,
                                      sum1 = 0, sum = 0, Max, Min, num;
vector<long long int> vc, kaj, zero;
map<long long int, long long int> input, output;
long long int vec[200009];
bool vis[200009];
set<long long int> s;
set<long long int>::iterator it;
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    s.insert(i);
  }
  for (i = 1; i <= n; i++) {
    cin >> a;
    vec[i] = a;
    if (a != 0) {
      s.erase(a);
      vis[a] = true;
    }
  }
  for (i = 1; i <= n; i++) {
    if (vec[i] == 0 && vis[i] == false) {
      it = s.begin();
      if (i != *it) {
        a = *it;
        vec[i] = a;
        s.erase(a);
        vis[a] = true;
      } else {
        b = *it;
        s.erase(b);
        it = s.begin();
        a = *it;
        vec[i] = a;
        s.erase(a);
        s.insert(b);
        vis[a] = true;
      }
    }
  }
  for (i = 1; i <= n; i++) {
    if (vec[i] == 0) {
      it = s.begin();
      if (i != *it) {
        a = *it;
        vec[i] = a;
        s.erase(a);
      } else {
        b = *it;
        s.erase(b);
        it = s.begin();
        a = *it;
        vec[i] = a;
        s.erase(a);
        s.insert(b);
      }
    }
  }
  for (i = 1; i <= n; i++) {
    cout << vec[i] << " ";
  }
}
