#include "bits/stdc++.h"

using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
	REP(i, v.size()) { if (i)os << " "; os << v[i]; }return os;
}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v) {
	REP(i, v.size()) { if (i)os << endl; os << v[i]; }return os;
}

const ll INF = LLONG_MAX;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

#define int long long

inline void my_io() {

	std::ios::sync_with_stdio(false);

	std::cin.tie(0);

	cout << fixed << setprecision(16);

	//cout << setprecision(10) << scientific << ans << endl;
}

//約数の列挙
vector<ll> divisor(ll n) {
	vector<ll> res;
	for (int i = 1; i * i <= n; i++) {
		if (n % i == 0) {
			res.push_back(i);
			if (i != n / i) {
				res.push_back(n / i);
			}
		}
	}
	return res;
}

signed main() {
	ll n;
	string s;

	cin >> n;

	ll ans = INF;
	char x;
	ll base, now, num;

	REP(i, n) {
		cin >> s;

		x = '0';

		REP(j, s.size()) {
			if (s[j] > x) {
				x = s[j];
			}
		}

		if (x > '9') {
			base = (x - 'A') + 10 + 1;
		}
		else {
			base = (x - '0') + 1;
		}

		now = 1;
		num = 0;

		RREP(j, s.size()) {
			if (s[j] > '9') {
				num += ((s[j] - 'A') + 10) * now;
			}
			else {
				num += (s[j] - '0') * now;
			}
			now *= base;
		}

		ans = min(ans, num);
	}

	cout << ans << endl;
}