#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000;
char s[maxn + 5], t[maxn + 5];
int cs[26], ct[26];
int L[26], R[26];
int main() {
	scanf("%s%s", s + 1, t + 1);
	int ls = strlen(s + 1), lt = strlen(t + 1);
	for (int i = 1; i <= ls; i++) cs[s[i] - 'a']++;
	for (int i = 1; i <= lt; i++) ct[t[i] - 'a']++;
	int ans = 1E9;
	for (int i = 0; i < 26; i++)
		if (ct[i]) ans = min(ans, cs[i] / ct[i]), cs[i] -= ct[i];
	if (!ans) return puts("0"), 0;
	for (int i = 1; i < lt; i++) {
		int c = lt / i;
		int mn = 0, mx = 0;
		bool flg = 1;
		for (int j = 0; j < 26; j++) {
			L[j] = (ct[j] + c) / (c + 1), R[j] = ct[j] / c;
			if (L[j] > R[j]) { flg = 0; break; }
			mn += L[j], mx += R[j];
		}
		if (!flg || i < mn || mx < i) continue;
		int l = 0, r = ls;
		while (l < r) {
			int mid = (l + r + 1) / 2;
			int mn2 = 0, mx2 = 0;
			bool flg2 = 1;
			for (int j = 0; j < 26; j++) {
				int nR = min(R[j], cs[j] / mid);
				if (L[j] > nR) { flg2 = 0; break; }
				mn2 += L[j], mx2 += R[j];
			}
			if (flg2 && mn2 <= i && i <= mx2) l = mid;
			else r = mid - 1;
		} 
		ans = max(ans, l + 1);
	}
	printf("%d", ans);
}