B'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], xe2 x80 x89a[j] and b is a beautiful triple (i xe2 x80 x89 xe2 x89 xa0 xe2 x80 x89j). A beautiful triple is such three pairwise coprime numbers x, xe2 x80 x89y, xe2 x80 x89z, which satisfy the following condition: x2 xe2 x80 x89+ xe2 x80 x89y2 xe2 x80 x89= xe2 x80 x89z2. 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106) which is the number of lawns. The next line contains n integers ai which are the number of mushrooms on the i-lawn (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89107). 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.'...