1 #include <map>
 2 #include <set>
 3 #include <stack>
 4 #include <queue>
 5 #include <cmath>
 6 #include <ctime>
 7 #include <vector>
 8 #include <cstdio>
 9 #include <cctype>
10 #include <cstring>
11 #include <cstdlib>
12 #include <iostream>
13 #include <algorithm>
14 using namespace std;
15 #define eps 1e-15
16 #define MAXN 105
17 #define INF 1000000007
18 #define MAX(a,b) (a > b ? a : b)
19 #define MIN(a,b) (a < b ? a : b)
20 #define mem(a) memset(a,0,sizeof(a))
21
22 bool G[MAXN][MAXN],vis[MAXN];
23 int Left[MAXN],N,M,T,a[MAXN],b[MAXN];
24
25 bool DFS(int u)
26 {
27     for(int v=0;v<=N;v++) if(G[u][v] && !vis[v])
28     {
29         vis[v] = true;
30         if(!Left[v] || DFS(Left[v]))
31         {
32             Left[v] = u;
33             return true;
34         }
35     }
36     return false;
37 }
38
39 int main()
40 {
41     while(~scanf("%d", &N))
42     {
43         mem(G); mem(Left);
44         int x,ans = 0;
45         for(int i=1;i<=N;i++) for(int j=1;j<=N;j++)
46         {
47             scanf("%d", &x);
48             if(x)G[i][j] = true;
49         }
50         for(int i=1;i<=N;i++)//求最大匹配
51         {
52             mem(vis);
53             if(DFS(i)) ans ++;
54         }
55         if(ans < N){printf("-1\n");continue;}//小于N无解
56         int tot = 0,j;
57         for(int i=1;i<=N;i++)
58         {
59             for(j=1;j<=N && Left[j]!=i ;j++);
60             if(i != j)//交换第i列和第j列
61             {
62                 a[tot] = i;  b[tot] = j; tot ++;//记录结果
63                 int t = Left[i]; Left[i] = Left[j]; Left[j] = t;
64             }
65         }
66         printf("%d\n",tot);
67         for(int i=0;i<tot;i++) printf("C %d %d\n", a[i],b[i]);
68     }
69     return 0;
70 }