#include <bits/stdc++.h>
using namespace std;
int shi(int a[], int k, int len) {
  int s = 0, j;
  for (j = len - 1; j >= 0; j--) {
    s = s * k + a[j];
  }
  return s;
}
int bian(int n, int k) {
  int i;
  for (i = 0; n > 0; i++) {
    n /= k;
  }
  return i;
}
int change(int a[1000], int n) {
  int i;
  for (i = 0; n > 0; i++) {
    a[i] = n % 10;
    n /= 10;
  }
  return i;
}
int main() {
  int a, b;
  int ta[1000], tb[1000];
  int i, la, lb;
  while (scanf("%d%d", &a, &b) != -1) {
    int max = 0;
    la = change(ta, a);
    lb = change(tb, b);
    for (i = 0; i < la; i++) {
      if (ta[i] > max) max = ta[i];
    }
    for (i = 0; i < lb; i++) {
      if (tb[i] > max) max = tb[i];
    }
    max += 1;
    int sa = shi(ta, max, la), sb = shi(tb, max, lb);
    int sum = sa + sb;
    int ss = bian(sum, max);
    printf("%d\n", ss);
  }
  return 0;
}
