CF60D.Savior
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Misha decided to help Pasha and Akim be friends again. He had a cunning plan — to destroy all the laughy mushrooms. He knows that the laughy mushrooms can easily burst when they laugh. Mushrooms grow on the lawns. There are a[t] mushrooms on the t -th lawn.
Misha knows that the lawns where the mushrooms grow have a unique ability. A lawn (say, i ) can transfer laugh to other lawn (say, j ) if there exists an integer (say, b ) such, that some permutation of numbers a[i],a[j] and b is a beautiful triple ( i=j ). A beautiful triple is such three pairwise coprime numbers x,y,z , which satisfy the following condition: x2+y2=z2 .
Misha wants to know on which minimal number of lawns he should laugh for all the laughy mushrooms to burst.
输入格式
The first line contains one integer n ( 1<=n<=106 ) which is the number of lawns. The next line contains n integers ai which are the number of mushrooms on the i -lawn ( 1<=ai<=107 ). All the numbers are different.
输出格式
Print a single number — the minimal number of lawns on which Misha should laugh for all the mushrooms to burst.
输入输出样例
输入#1
1 2
输出#1
1
输入#2
2 1 2
输出#2
2
输入#3
2 3 5
输出#3
1