#include<bits/stdc++.h>
using namespace std;
string a, b, c;
int n, a1[30], b1[30], c1;
int ans[30];
bool book[30];
int c2[30];
int add(int a2[30], int b2[30]) {
	int ans1 = 0;
	for (int i = 1; i <= n; i++) {
		c2[i] += a2[i] + b2[i];
		c2[i + 1] = c2[i] / n;
		c2[i] %= n;
	}
	for (int i = n + 1; i >= 1; i--) {
		ans1 = ans1 * 10 + c[i];
	}
	return ans1;
}
bool check() {
	for (int i = n - 1; i >= 0; i--) {
		a1[n - i] = ans[int(a[i] - 'A') + 1];
		b1[n - i] = ans[int(b[i] - 'A') + 1];
		c1 = c1 * 10 + ans[int(c[i] - 'A') + 1];
	}
	if (add(a1, b1) == c1) return 1;
	return 0;
}
void dfs(int t) {
	if (t == n + 1) {
		if (check()) {
			for (int i = 1; i <= n; i++) cout << ans[i] << " ";
			cout << endl;
		}
		return ;
	}
	for (int i = 0; i < n; i++) {
		//if(i==0&&(a[t-1]==char(t-1+'A')||b[t-1]==char(t-1+'A')||c[t-1]==char(t-1+'A'))) continue;
		if (book[i]) continue;
		ans[t] = i;
		book[i] = 1;
		dfs(t + 1);
		book[i] = 0;
	}
}
int main() {
	cin >> n >> a >> b >> c;
	dfs(1);
	return 0;
}