URI 1663 solution

URI 1663 solution

///URI OJ :1663 
///Author : Shohanur Rahaman

#include<stdio.h>

    int ara[1000005];
    int invara[1000005];

int main()
{
    int n,i,count;

        while(scanf("%d",&n)==1){
                count=0;
                if(n==0)
                break;

                for(i=1;i<=n;i++){
                    scanf("%d",&ara[i]);
                    invara[ara[i]]=i;
                }
                    for(i=1;i<=n;i++){
                        if(ara[i]==invara[i])
                        count++;
                    }
                        if(count==n)
                        printf("ambiguous\n");
                        else
                        printf("not ambiguous\n");
        }

    return 0;
}