from collections import Counter
def solve(s,t):
s_count = Counter(s)
t_count = Counter(t)
ans = float('inf')
for ch in t_count:
if ch not in s_count:
return 0
ans = min(ans, s_count[ch]//t_count[ch])
return ans
def main():
s = input().strip()
t = input().strip()
print(solve(s,t))
if __name__=="__main__":
main()
ZnJvbSBjb2xsZWN0aW9ucyBpbXBvcnQgQ291bnRlcgoKZGVmIHNvbHZlKHMsdCk6CglzX2NvdW50ID0gQ291bnRlcihzKQoJdF9jb3VudCA9IENvdW50ZXIodCkKCQoJYW5zID0gZmxvYXQoJ2luZicpCgkKCWZvciBjaCBpbiB0X2NvdW50OgoJCWlmIGNoIG5vdCBpbiBzX2NvdW50OgoJCQlyZXR1cm4gMAoJCWFucyA9IG1pbihhbnMsIHNfY291bnRbY2hdLy90X2NvdW50W2NoXSkKCXJldHVybiBhbnMKCmRlZiBtYWluKCk6CglzID0gaW5wdXQoKS5zdHJpcCgpCgl0ID0gaW5wdXQoKS5zdHJpcCgpCgkKCXByaW50KHNvbHZlKHMsdCkpCgkKaWYgX19uYW1lX189PSJfX21haW5fXyI6CgltYWluKCk=