#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int c2v[256];

int main(int argc, char **argv) {
	ull res = -1;
	REP(i, 10) c2v['0' + i] = i;
	REP(i, 'Z' - 'A' + 1) c2v['A' + i] = 10 + i;
	int N;
	cin >> N;
	REP(i, N) {
		string V;
		cin >> V;
		int b = 2;
		REP(j, V.length()) b = max(b, c2v[V[j]] + 1);
		ull v = 0;
		REP(j, V.length()) {
			v *= b;
			v += c2v[V[j]];
		}
		res = min(res, v);
	}
	cout << res << endl;
	return 0;
}