5 人解决，15 人已尝试。
5 份提交通过，共有 40 份提交。
8.5 EMB 奖励。
单点时限: 5.0 sec
内存限制: 256 MB
Stancu likes space travels but he is a poor software developer and will never be able to buy his own spacecraft. That is why he is preparing to steal the spacecraft of Petru. There is only one problem – Petru has locked the spacecraft with a sophisticated cryptosystem based on the ID numbers of the stars from the Milky Way Galaxy. For breaking the system Stancu has to check each subset of four stars such that the only common divisor of their numbers is 1. Nasty, isn’t it?
Fortunately, Stancu has succeeded to limit the number of the interesting stars to N but, any way, the possible subsets of four stars can be too many. Help him to find their number and to decide if there is a chance to break the system.
In the input file several test cases are given. For each test case on the first line the number N of interesting stars is given (1 ≤ N ≤ 10000). The second line of the test case contains the list of ID numbers of the interesting stars, separated by spaces. Each ID is a positive integer which is no greater than 10000. The input data terminate with the end of file.
For each test case the program should print one line with the number of subsets with the asked property.
4 2 3 4 5 4 2 4 6 8 7 2 3 4 5 7 6 8
1 0 34
5 人解决，15 人已尝试。
5 份提交通过，共有 40 份提交。
8.5 EMB 奖励。
创建: 15 年，1 月前.
修改: 7 年，2 月前.
最后提交: 1 年，5 月前.