#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <array>
#include <climits>
#include <bitset>
#include <cassert>
#include <unordered_map>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;

int g(char c){
	if ('0' <= c && c <= '9') return c - '0';
	return c - 'A' + 10;
}

ll f(string &s, int i, int x){
	if (i < 0) return 0;
	int a = g(s[i]);
	if (a >= x) return -1;
	return a + x*f(s, i - 1, x);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.setf(ios::fixed);
	cout.precision(20);

	int n;
	cin >> n;

	ll ans = 5e18;
	rep(i, n){
		string s;
		cin >> s;
		FOR(j, 2, 37){
			ll x = f(s, s.size() - 1, j);
			if (x < 0) continue;
			ans = min(ans, x);
		}
	}
	cout << ans << endl;

}