1191 12!配对


Submit solution

Points: 100
Time limit: 1.0s
Memory limit: 32M

Problem types
Allowed languages
C, C++, Java, Python

Description

找出输入数据中所有两两相乘的积为12!的个数。

Input

输入数据中含有一些整数n(1≤n<2^32)。

Output

输出所有两两相乘的积为12!的个数。

Sample

Input

1 10000 159667200 9696 38373635
1000000 479001600 3

Output

2

Source: qianneng


Comments

There are no comments at the moment.