#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

unsigned long long poworig(int x,int y){
   unsigned long long ans = 1;
   while(y--) ans *= x;
   return ans;
}

int main(){
   int n;
   cin >> n;
   unsigned long long ans[n];
   fill(ans,ans + n,0);
   for(int i = 0;i < n;i++){
      int base,pow = 0;
      string s;
      cin >> s;
      char c = '0';
      for(int j = 0;j < s.size();j++) c = max(c,s[j]);
      base = (isdigit(c) ? c - '0' : c - 'A' + 10) + 1;
      for(int j = s.size() - 1;j >= 0;j--) ans[i] += poworig(base,pow++) * (isdigit(s[j]) ? s[j] - '0' : s[j] - 'A' + 10);
   }
   stable_sort(ans,ans + n);
   cout << ans[0] << endl;
}