Toy Marbles

Busy Beaver has discovered that someone has mixed up his toy marbles!

There are $N$ containers, numbered from $1$ to $N$. The $i$-th container currently contains a single marble of color $c_i$.

Busy Beaver wants to tidy up his marbles so that the $i$-th container only contains marbles of color $i$. To achieve this, he can perform either of the following actions any number of times (possibly zero):

• Swap the marbles in two containers $x$ and $y$. After this action, all marbles from container $x$ move to container $y$, and vice versa.
• Move all the marbles from one container $y$ to another container $x$. After this action, container $y$ becomes empty, and all its marbles are moved to container $x$.

Find a way to organize the marbles using the minimum number of actions.

The first line contains an integer $N$ ($1\leq N\leq 2\cdot 10^5$) — the number of containers.

The second line contains $N$ integers $c_1,c_2,\dots ,c_N$ ($1\leq c_i\leq N$) — the marble initially in each container.

On the first line, print a single integer $K$ — the minimum number of actions required.

On the next $K$ lines, describe the actions in order, one per line. Each action should be in one of the following formats:

• 1 $x$ $y$: Swap the marbles in containers $x$ and $y$ ($1\leq x,y\leq N$; $x\neq y$).
• 2 $x$ $y$: Move all marbles from container $y$ to container $x$ ($1\leq x,y\leq N$; $x\neq y$).

If there are multiple ways to achieve the goal in the minimum number of actions, you may print any valid solution.