#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<utility>
using namespace std;

#define ll long long
#define nl '\n'
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
/*
███╗░░██╗███████╗░██████╗░███╗░░░███╗
████╗░██║██╔════╝██╔════╝░████╗░████║
██╔██╗██║█████╗░░██║░░██╗░██╔████╔██║
██║╚████║██╔══╝░░██║░░╚██╗██║╚██╔╝██║
██║░╚███║███████╗╚██████╔╝██║░╚═╝░██║
╚═╝░░╚══╝╚══════╝░╚═════╝░╚═╝░░░░░╚═╝

*/

void Fast_IO(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif
}





void solve(){
  ll n; cin>>n;
  vector<bool>found(n+5);
  deque<ll>non;
  vector<ll>v;
  for(int i=0; i<n; i++){
      ll x; cin>>x;
      v.push_back(x);
      if(x != 0) found[x]=1;
  }
  for(int i=1; i<=n; i++){
      if(found[i]==0) non.push_back(i);
  }

  for(int i=0; i<n; i++){
      if(v[i]==0){
          if(non.back() != i+1){
          cout<<non.back()<<' ';
          non.pop_back();
          }
      else{
          cout<<non.front()<<' ';
          non.pop_front();
      }
      }else cout<<v[i]<<' ';
  }







}

int main(){
    Fast_IO();
int t =1;
//cin>>t;
while(t--){
solve();
}
return 0;
}