Sheldon and Ice Pieces

题意翻译

# 题目描述 小谢尔顿玩冰块，每一块上都刻有0~9的某一个数字。他想用冰块拼出他最喜欢的整数t。他发现数字6和9非常相似，所以他可以把刻有6的冰块旋转一下作为9使用（反之亦然）。同样地，2和5也可以这样互换使用。其他数字没有这样的情况。他希望用已有的冰块拼出尽可能多的t来，每个冰块最多使用1次。问他可以用这些冰块拼出几个t出来？ # 输入格式 第一行是小谢尔顿喜欢的那个整数t， 1<=t<=10000)。 第二行是一串数字（数字的个数：1~200个），表示已有的冰块上的数字。 # 输出格式 1个整数。

题目描述

Do you remember how Kai constructed the word "eternity" using pieces of ice as components? Little Sheldon plays with pieces of ice, each piece has exactly one digit between 0 and 9. He wants to construct his favourite number $ t $ . He realized that digits 6 and 9 are very similar, so he can rotate piece of ice with 6 to use as 9 (and vice versa). Similary, 2 and 5 work the same. There is no other pair of digits with similar effect. He called this effect "Digital Mimicry". Sheldon favourite number is $ t $ . He wants to have as many instances of $ t $ as possible. How many instances he can construct using the given sequence of ice pieces. He can use any piece at most once.

输入输出格式

输入格式

The first line contains integer $ t $ ( $ 1<=t<=10000 $ ). The second line contains the sequence of digits on the pieces. The length of line is equal to the number of pieces and between 1 and 200, inclusive. It contains digits between 0 and 9.

输出格式

Print the required number of instances.

输入输出样例

输入样例 #1

42
23454

输出样例 #1

2

输入样例 #2

169
12118999

输出样例 #2

1

说明

This problem contains very weak pretests.