#include<iostream>

#include<cstdio>

#include<cstring>

#include<map>

#include<cctype>

#include<algorithm>

#define REP(i,n) for (int i = 1; i <= (n); i++)

using namespace std;

const int maxn = 13,maxm = 105,INF = 1000000000;

map<char,int> Id;

int n,siz = 0,num[maxn];

bool used[maxn];

char names[maxn];

inline char RC(){

	char c = getchar();

	while (!isalpha(c) && c != '+') c = getchar();

	return c;

}

inline int code(char c){

	if (!Id.count(c)){Id[c] = ++siz; names[siz] = c;}

	return Id[c];

}

struct Num{

	int s[maxn],len;

	Num() {memset(s,0,sizeof(s)); len = 0;}

	bool iscal(){

		REP(i,len) if (num[s[i]] == -1) return false;

		return true;

	}

	int getn(){

		int ans = 0;

		for (int i = 1; i <= len; i++) ans = ans * n + num[s[i]];

		return ans;

	}

	void getR(){

		char c = getchar();

		while (!isalpha(c)) c = getchar();

		while (isalpha(c)){s[++len] = code(c); c = getchar();}

	}

}sum[maxn][maxn];

void init(){

	fill(num,num + maxn,-1);

	scanf("%d",&n); n--;

	int u; RC();

	REP(i,n) code(RC());

	REP(i,n){

		u = code(RC());

		REP(j,n) sum[u][j].getR();

	}

	bool flag = true;

	REP(i,n){

		flag = true;

		REP(j,n) if (sum[i][j].len != 1 || sum[i][j].s[1] != j) {flag = false; break;}

		if (flag){num[i] = 0; break;}

	}

	if (!flag){cout<<"ERROR!"<<endl;exit(0);}

}

bool check(int u){

	REP(i,n) if (num[i] != -1 && sum[u][i].iscal() && num[u] + num[i] != sum[u][i].getn())

		return false;

	return true;

}

void dfs(int u){

	if (u > n){

		printf("%c=%d",names[1],num[1]);

		for (int i = 2; i <= n; i++)

			printf(" %c=%d",names[i],num[i]);

		printf("\n%d\n",n);

		exit(0);

	}

	if (num[u] != -1) dfs(u + 1);

	else {

		for (int i = 1; i < n; i++){

			if (!used[i]){

				num[u] = i;

				if (check(u)) dfs(u + 1);

				num[u] = -1;

			}

		}

	}

}

int main()

{

	init();

	dfs(1);

	cout<<"ERROR!"<<endl;

	return 0;

}