There is a directed graph with N vertices and N edges. The vertices are numbered 1, 2, ..., N.

The graph has the following N edges: (p_1, 1), (p_2, 2), ..., (p_N, N), and the graph is weakly connected. Here, an edge from Vertex u to Vertex v is denoted by (u, v), and a weakly connected graph is a graph which would be connected if each edge was bidirectional.

We would like to assign a value to each of the vertices in this graph so that the following conditions are satisfied. Here, a_i is the value assigned to Vertex i.

* Each a_i is a non-negative integer.
* For each edge (i, j), a_i \neq a_j holds.
* For each i and each integer x(0 ≤ x < a_i), there exists a vertex j such that the edge (i, j) exists and x = a_j holds.



Determine whether there exists such an assignment.

Constraints

* 2 ≤ N ≤ 200 000
* 1 ≤ p_i ≤ N
* p_i \neq i
* The graph is weakly connected.

Input

Input is given from Standard Input in the following format:


N
p_1 p_2 ... p_N


Output

If the assignment is possible, print `POSSIBLE`; otherwise, print `IMPOSSIBLE`.

Examples

Input

4
2 3 4 1


Output

POSSIBLE


Input

3
2 3 1


Output

IMPOSSIBLE


Input

4
2 3 1 1


Output

POSSIBLE


Input

6
4 5 6 5 6 4


Output

IMPOSSIBLE
import java.io.*;
import java.util.*;

public class Main {
    static List<Integer>[] edges;
    static boolean[] inCycle;
    static int[] val;
    public static boolean dfs(int u, int[] state) {
        state[u] = 1;
        for (int v: edges[u]) {
            if (state[v] == 1) {
                state[u] = 2;
                inCycle[v] = true;
                return true;
            } else if (state[v] == 0) {
                if (dfs(v, state)) {
                    inCycle[v] = true;
                    return !inCycle[u];
                }
            }
        }
        state[u] = 2;
        return false;
    }

    public static void dfs2(int u, int p) {
        Set<Integer> fb = new HashSet<>();
        for (int v: edges[u]) {
            if (v == p || inCycle[v]) continue;
            dfs2(v, p);
            fb.add(val[v]);

        }
        for (int i = 0;; i++) {
            if (!fb.contains(i)) {
                val[u] = i;
                return;
            }
        }
    }

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        inCycle = new boolean[n];
        val = new int[n];
        edges = new List[n];
        int[] p = new int[n];
        for (int i = 0; i < n; i++) {
            edges[i] = new ArrayList<>();
        }
        for (int i = 0; i < n; i++) {
            p[i] = sc.nextInt() - 1;
            edges[p[i]].add(i);
        }
        int[] state = new int[n];
        for (int i = 0; i < n; i++) {
            if (state[i] != 2) dfs(i, state);
        }
        int cntCycleSize = 0;

        for (int i = 0; i < n; i++) {
            if (inCycle[i]) cntCycleSize++;
        }

        for (int i = 0; i < n; i++) {
            if (inCycle[i]) dfs2(i, -1);
        }
        Set<Integer> ss = new HashSet<>();
        for (int i = 0; i < n; i++) {
            if (inCycle[i]) {
                ss.add(val[i]);
            }
        }
        if (ss.size() != 1 || cntCycleSize % 2 == 0) {
            System.out.println("POSSIBLE");
        } else {
            System.out.println("IMPOSSIBLE");
        }
    }

    public static class Scanner {
        StringTokenizer st;
        BufferedReader br;
        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }
        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
            return st.nextToken();
        }
        public int nextInt() throws IOException{
            return Integer.parseInt(next());
        }
    }
}