#include <bits/stdc++.h>
using namespace std;
long long int dx[] = {1, -1, 0, 0};
long long int dy[] = {0, 0, -1, 1};
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  return a.second - a.first + 1 < b.second - b.first + 1;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int power_mod(long long int a, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1)
      res = ((res % 1000000007) * (a % 1000000007)) % 1000000007, n--;
    else
      a = ((a % 1000000007) * (a % 1000000007)) % 1000000007, n /= 2;
  }
  return res;
}
long long int nCr(long long int n, long long int r) {
  if (r > n) return 0;
  double res = 1;
  for (long long int i = 1; i <= r; i++) res = (res * (n - r + i)) / i;
  return (long long int)(res + 0.01);
}
long long int power(long long int a, long long int n) {
  long long int res = 1;
  for (long long int i = 0; i < n; i++) res *= a;
  return res;
}
void solve() {
  string t, str;
  cin >> t >> str;
  long long int a[10];
  long long int b[10];
  for (long long int i = 0; i < 10; i++) a[i] = b[i] = 0;
  for (long long int i = 0; i < t.size(); i++) a[t[i] - '0']++;
  for (long long int i = 0; i < str.size(); i++) b[str[i] - '0']++;
  long long int ans = 0;
  bool flag = false;
  while (1) {
    for (long long int i = 0; i < 10; i++) {
      long long int x = a[i];
      if (i == 2 || i == 5) {
        if (b[2] + b[5] < x) {
          flag = true;
          break;
        } else {
          if (b[2] >= x)
            b[2] -= x;
          else {
            x -= b[2];
            b[2] = 0;
            b[5] -= x;
          }
        }
      } else if (i == 6 || i == 9) {
        if (b[6] + b[9] < x) {
          flag = true;
          break;
        } else {
          if (b[6] >= x)
            b[6] -= x;
          else {
            x -= b[6];
            b[6] = 0;
            b[9] -= x;
          }
        }
      } else {
        if (b[i] >= x)
          b[i] -= x;
        else {
          flag = true;
          break;
        }
      }
    }
    if (flag) break;
    ans++;
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    solve();
  }
}
