func_code_string: #include <bits/stdc++.h>   using namespace std;   const double PI = acos(-1);   const double eps = 1e-12;   const int inf = 2000000000;   const long long int infLL = (long long int)1e18;   long long int MOD = 1000000007;   int MOD1 = 1000000007;   int MOD2 = 1000000009;   inline bool checkBit(long long int n, long long int i) {     return n & (1LL << i);   }   inline long long int setBit(long long int n, long long int i) {     return n | (1LL << i);     ;   }   inline long long int resetBit(long long int n, long long int i) {     return n & (~(1LL << i));   }   int dx[] = {0, 0, +1, -1};   int dy[] = {+1, -1, 0, 0};   inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }   inline bool isLeapYear(long long int year) {     return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);   }   inline void normal(long long int &a) {     a %= MOD;     (a < 0) && (a += MOD);   }   inline long long int modMul(long long int a, long long int b) {     a %= MOD, b %= MOD;     normal(a), normal(b);     return (a * b) % MOD;   }   inline long long int modAdd(long long int a, long long int b) {     a %= MOD, b %= MOD;     normal(a), normal(b);     return (a + b) % MOD;   }   inline long long int modSub(long long int a, long long int b) {     a %= MOD, b %= MOD;     normal(a), normal(b);     a -= b;     normal(a);     return a;   }   inline long long int modPow(long long int b, long long int p) {     long long int r = 1LL;     while (p) {       if (p & 1) r = modMul(r, b);       b = modMul(b, b);       p >>= 1LL;     }     return r;   }   inline long long int modDiv(long long int a, long long int b) {     return modMul(a, modPow(b, MOD - 2));   }   bool comp(const pair<long long int, pair<long long int, long long int> > &p1,             const pair<long long int, pair<long long int, long long int> > &p2) {     return p1.first > p2.first;   }   bool comp1(const pair<long long int, long long int> &p1,              const pair<long long int, long long int> &p2) {     if (p1.first == p2.first) {       return p1.second > p2.second;     }     return p1.first < p2.first;   }   long long int converter(string a) {     long long int i, mul = 1LL, r, t, ans = 0LL;     if (a.length() == 0) return 0;     for (i = a.length() - 1; i >= 0; i--) {       t = a[i] -  0 ;       r = t % 10;       ans += (mul * r);       mul = mul * 10;     }     return ans;   }   int msb(unsigned x) {     union {       double a;       int b[2];     };     a = x;     return (b[1] >> 20) - 1023;   }   const int MAX = 300005;   long long int g[3][MAX], a[MAX];   long long int x, y, z, magic, n;   const int ex = 70;   const int lim = 1000;   int grundy(int a, int b, int c) {     set<long long int> s;     s.insert(a);     s.insert(b);     s.insert(c);     int val = 0;     while (s.find(val) != s.end()) ++val;     return val;   }   void calc() {     for (int i = 1; i <= lim; ++i) {       long long int cur1 = max(0LL, i - x);       long long int cur2 = max(0LL, i - y);       long long int cur3 = max(0LL, i - z);       g[0][i] = grundy(g[0][cur1], g[1][cur2], g[2][cur3]);       g[1][i] = grundy(g[0][cur1], inf, g[2][cur3]);       g[2][i] = grundy(g[0][cur1], g[1][cur2], inf);     }   }   void findPeriod() {     magic = 0;     for (int perLen = 1; !magic; ++perLen) {       int f = 1;       for (int i = ex; i < ex + perLen && f; ++i) {         for (int j = i; j <= lim && f; j += perLen) {           if (g[0][i] != g[0][j] || g[1][i] != g[1][j] || g[2][i] != g[2][j])             f = 0;         }       }       if (f) magic = perLen;     }   }   int ask(long long int pile, int state) {     pile = max(0LL, pile);     if (pile <= lim)       return g[state][pile];     else       return g[state][(pile - ex) % magic + ex];   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     ;     cout.unsetf(ios::floatfield);     cout.precision(20);     cout.setf(ios::fixed, ios::floatfield);     ;     int t;     cin >> t;     while (t--) {       cin >> n >> x >> y >> z;       calc();       findPeriod();       if (magic >= 30) {         cout <<  MAgic  << magic <<   n ;         return 0;       }       long long int nimber = 0;       for (int i = 1; i <= n; ++i) {         cin >> a[i];         nimber ^= ask(a[i], 0);       }       int ans = 0;       for (int i = 1; i <= n; ++i) {         long long int save = nimber ^ ask(a[i], 0);         long long int temp = save ^ ask(a[i] - x, 0);         if (!temp) ans++;         temp = save ^ ask(a[i] - y, 1);         if (!temp) ans++;         temp = save ^ ask(a[i] - z, 2);         if (!temp) ans++;       }       cout << ans <<   n ;     }     return 0;   }   