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()