Advertisement blocking software were detected ;( Please add this webpage to whitelist.

PERMUT2 - Ambiguous Permutations

Some programming contest problems are really tricky: not only do they require a different output format from what you might have expected, but also the sample output does not show the difference. For an example, let us look at permutations.
A permutation of the integers 1 to n is an ordering of these integers. So the natural way to represent a permutation is to list the integers in this order. With n = 5, a permutation might look like 2, 3, 4, 5, 1.
However, there is another possibility of representing a permutation: You create a list of numbers where the i-th number is the position of the integer i in the permutation. Let us call this second possibility an inverse permutation. The inverse permutation for the sequence above is 5, 1, 2, 3, 4.
An ambiguous permutation is a permutation which cannot be distinguished from its inverse permutation. The permutation 1, 4, 3, 2 for example is ambiguous, because its inverse permutation is the same. To get rid of such annoying sample test cases, you have to write a program which detects if a given permutation is ambiguous or not.

Input Specification

The input contains several test cases.
The first line of each test case contains an integer n (1 ≤ n ≤ 100000). Then a permutation of the integers 1 to n follows in the next line. There is exactly one space character between consecutive integers. You can assume that every integer between 1 and n appears exactly once in the permutation.
The last test case is followed by a zero.

Output Specification

For each test case output whether the permutation is ambiguous or not. Adhere to the format shown in the sample output.

Sample Input

1 4 3 2
2 3 4 5 1

Sample Output

not ambiguous

hide comments
raghav12345: 2015-11-14 08:28:58

easy one....

Divyansh Khanna: 2015-10-29 18:19:27

AC in the 1st go!! 6 lines of code!

abhisheshfreak: 2015-10-21 19:58:29

read it carefully...... Piece of cake ;-)

vishals: 2015-10-18 14:46:50

ac in one go... just read Ambiguous Permutation :)
happy coding !!!

mkatiyar: 2015-09-14 11:10:03

:-( Costed me 1 WA due to typo as "non" instead of "not"

kartikay singh: 2015-08-30 07:43:39

last test case by 0 ;) missed that :(

Mohit: 2015-08-27 04:21:31

got AC in first attempt.?
be care only about " the i-th number is the position of the integer i in the permutation"

Shivam Singh: 2015-08-22 01:34:02

Green at first sight after a long time :P :D

suhas: 2015-08-18 21:07:05

My 20th :). got WA coz used "non" instead of "not" :/

Babu: 2015-08-14 19:21:51

very very easy

Added by:Adrian Kuegel
Time limit:10s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: NODEJS PERL 6
Resource:own problem, used in University of Ulm Local Contest 2005