CodeForces - 266C

You are given a square matrix consisting of n rows and n columns. We assume that the rows are numbered from 1 to n from top to bottom and the columns are numbered from 1to n from left to right. Some cells (n - 1 cells in total) of the the matrix are filled with ones, the remaining cells are filled with zeros. We can apply the following operations to the matrix:

1. Swap i-th and j-th rows of the matrix;
2. Swap i-th and j-th columns of the matrix.

You are asked to transform the matrix into a special form using these operations. In that special form all the ones must be in the cells that lie below the main diagonal. Cell of the matrix, which is located on the intersection of the i-th row and of the j-th column, lies below the main diagonal if i > j.

Input

The first line contains an integer n (2 ≤ n ≤ 1000) — the number of rows and columns. Then follow n - 1 lines that contain one's positions, one per line. Each position is described by two integers xk, yk (1 ≤ xk, yk ≤ n), separated by a space. A pair (xk, yk) means that the cell, which is located on the intersection of the xk-th row and of the yk-th column, contains one.

It is guaranteed that all positions are distinct.

Output

Print the description of your actions. These actions should transform the matrix to the described special form.

In the first line you should print a non-negative integer m (m ≤ 105) — the number of actions. In each of the next m lines print three space-separated integers t, i, j(1 ≤ t ≤ 2, 1 ≤ i, j ≤ n, i ≠ j), where t = 1 if you want to swap rows, t = 2 if you want to swap columns, and i and j denote the numbers of rows or columns respectively.

Please note, that you do not need to minimize the number of operations, but their number should not exceed 105. If there are several solutions, you may print any of them.

Examples

Input

2
1 2

Output

2
2 1 2
1 1 2

Input

3
3 1
1 3

Output

3
2 2 3
1 1 3
1 1 2

Input

3
2 1
3 2

Output

0

【题意】

给你一个n*n的矩阵，有n-1个位置为1，其余为零；

进行至多10的五次方次交换，每次可以交换任意两行或两列，把1交换到对角线以下。

【思路】

递归来做，因为有n-1个1，肯定有一列为0，把最后一列当成0，再找一行有1的，和最后一行交换，

这样就变成了求(n-1)*(n-1)矩阵中有n-2个1的问题。

#include <iostream>
#include <vector>
using namespace std;
#define maxn 1010
#define inf 0x3f
struct node
{
    int op;
    int x;
    int y;
};
vector <node> r;
int a[maxn][maxn];
void solve(int n)
{
    if(n==0)
        return;
    for(int j=n;j>=1;j--)
    {
        int flag=1;
        for(int i=1;i<=n;i++)
        {
            if(a[i][j]==1)
            {
                flag=0;
                break;
            }
        }
        if(flag&&j!=n)
        {
            for(int i=1;i<=n;i++)
            {
                swap(a[i][j],a[i][n]);
            }
            node t;
            t.op=2;
            t.x=j;
            t.y=n;
            r.push_back(t);
            break;
        }
        if(flag&&j==n)
            break;
    }
    for(int i=n;i>=1;i--)
    {
        int flag=0;
        for(int j=1;j<=n;j++)
        {
            if(a[i][j]==1)
            {
                flag=1;
                break;
            }
        }
        if(flag&&n!=i)
        {
            for(int j=1;j<=n;j++)
                swap(a[i][j],a[n][j]);
            node t;
            t.op=1;
            t.x=i;
            t.y=n;
            r.push_back(t);
            break;
        }
        if(flag&&n==i)
            break;
    }
    solve(n-1);
}
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            a[i][j]=0;
    }
    for(int i=1;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        a[x][y]=1;
    }
    solve(n);
    cout<<r.size()<<endl;
    for(int i=0;i<r.size();i++)
    {
       cout<<r[i].op<<" "<<r[i].x<<" "<<r[i].y<<endl;
    }
    return 0;
}