#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int mod=1e9+;

 const int N=;

 int n,p[N],cnt[N],Cnt[N],base[N],To1[N],To2[N],jc[N],x,ans;

 vector<int> fac[N];

 void fail(){puts("");exit();}//这个东西超级好用！

 void shai()

 {

     for (int i=;i<=n;i++)

     if (!p[i])

     {

         cnt[n/i]++;

         for (int j=i;j<=n;j+=i)

         {

             p[j]=;base[j]*=i;

             fac[j].push_back(i);

         }

     }

 }

 void check(int x,int y)

 {

    if (fac[x].size()!=fac[y].size()) fail();

    for (int i=;i<fac[x].size();i++)

    {

        int fu=fac[x][i],fv=fac[y][i];

        int u=(x==)?:n/fu,v=(y==)?:n/fv;

        if (u!=v) fail();

        if (To1[fu]&&To1[fu]!=fv) fail();

        if (To2[fv]&&To2[fv]!=fu) fail();

        if (!To2[fv]) To1[fu]=fv,To2[fv]=fu,cnt[u]--;

     }

     Cnt[base[x]]--;

 }

 int main()

 {

     scanf("%d",&n);

     jc[]=;cnt[]=;//1和所有数互质!!!

     for (int i=;i<=n;i++) jc[i]=(ll)jc[i-]*i%mod,base[i]=;

     shai();fac[].push_back();//!!!

     for (int i=;i<=n;i++) Cnt[base[i]]++;

     for (int i=;i<=n;i++)

     {

        scanf("%d",&x);

        if (x) check(i,x);

    }

    ans=;

    for (int i=;i<=n;i++)

      ans=(ll)ans*jc[cnt[i]]%mod*jc[Cnt[i]]%mod;

    printf("%d\n",ans);

    return ;

 }