#include <bits/stdc++.h>
using namespace std;
const int N=10;
int a[N][5];
int n,ans=0,ans1=0,ans2=0;
int s[5];
void quan(int id){
	if(id==5){
		int flg=0;
		for(int k=0;k<n;k++){
			int dif=0;
			for(int j=0;j<5;j++){
				if(s[j]!=a[k][j]){
					dif++;
				}
			}
			if(dif>=3||dif==0){
				flg=0;
				break;
			}
			else if(dif==1){
				flg=1;
				ans1++;
			}
			else if(dif==2){
				for(int j=0;j<4;j++){
					if(s[j]!=a[k][j]&&s[j+1]!=a[k][j+1]){
						if(a[k][j]==a[k][j+1]&&s[j]==s[j+1]){
							flg=1;
							ans2++;
							break;
						}
						else if(a[k][j]==a[k][j+1]&&s[j]!=s[j+1])break;
						if(s[j]<a[k][j]&&s[j+1]>a[k][j+1]){
							if(a[k][j]-s[j]==s[j+1]-a[k][j+1]){
								flg=1;
								ans2++;
								break;
							}
						}
						else if(s[j]<a[k][j]&&s[j+1]<a[k][j+1]){
							if(a[k][j]-s[j]==a[k][j+1]-s[j+1]){
								flg=1;
								ans2++;
								break;
							}
						}
						else if(s[j]>a[k][j]&&s[j+1]>a[k][j+1]){
							if(s[j]-a[k][j]==s[j+1]-a[k][j+1]){
								flg=1;
								ans2++; 
								break;
							}
						}
						else if(s[j]>a[k][j]&&s[j+1]<a[k][j+1]){
							if(s[j]-a[k][j]==a[k][j+1]-s[j+1]){
								flg=1;
								ans2++;
								break;
							}
						}
					}
				}
			}
		}
		ans+=flg;
		if(flg){
			cout << "第" << ans << "个";
			for(int i=0;i<5;i++){
				cout << s[i];
			}
			cout << endl;
		}
		return;
	}
	for(int i=0;i<=9;i++){
		s[id]=i;
		quan(id+1);
		s[id]=-1;
	}
}
int main(){
	cin >> n;
	for(int i=0;i<n;i++){
		cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3] >> a[i][4];
	}
	quan(0);
	cout << ans;
	cout << endl << ans1 << " " << ans2;
	return 0;
}