1 #include<cstdio>
 2 #include<cstring>
 3 using namespace std;
 4 const int maxn = 100005;
 5 int sg[maxn];
 6 int a[maxn];
 7 bool vis[maxn];
 8 
 9 void getSg()
10 {
11 
12     sg[0]=0;
13     for(int i=1;i<maxn;i++)
14     {
15         memset(vis,0,sizeof(vis));
16 
17         for(int j=1;j*j<=i;j++)
18         {
19             if(i%j==0)
20             {
21                 vis[sg[i-j]]=1;
22                 vis[sg[i-i/j]]=1;
23             }
24         }
25 
26         for(int j=0;j<maxn;j++)
27         {
28             if(vis[j]==0)
29             {
30                 sg[i]=j;
31                 break;
32             }
33         }
34     }
35 }
36 
37 int main()
38 {
39     getSg();
40     int n;
41     scanf("%d",&n);
42     int sum = 0;
43     for(int i=1;i<=n;i++)
44     {
45         scanf("%d",&a[i]);
46         sum ^= sg[a[i]];
47     }
48     int ans = 0;
49     for (int i = 1; i <= n; ++i)
50     {
51         sum ^= sg[a[i]];
52         for (int j = 1; j * j <= a[i]; ++j)
53         {
54             if (a[i] % j == 0)
55             {
56                 if (!(sg[a[i] - j] ^ sum))
57                     ans++;
58                 if (j * j != a[i] && !(sg[a[i] - a[i] / j] ^ sum))
59                     ans++;
60             }
61         }
62         sum ^= sg[a[i]];
63     }
64     printf("%d\n",ans);
65     return 0;
66 }