func_code_string: #include <bits/stdc++.h>   using namespace std;   void __print(long long x) { cerr << x; }   void __print(long x) { cerr << x; }   void __print(unsigned x) { cerr << x; }   void __print(unsigned long x) { cerr << x; }   void __print(unsigned long long x) { cerr << x; }   void __print(float x) { cerr << x; }   void __print(double x) { cerr << x; }   void __print(long double x) { cerr << x; }   void __print(char x) { cerr <<      << x <<     ; }   void __print(const char *x) { cerr <<     << x <<    ; }   void __print(const string &x) { cerr <<     << x <<    ; }   void __print(bool x) { cerr << (x ?  true  :  false ); }   template <typename T, typename V>   void __print(const pair<T, V> &x) {     cerr <<  { ;     __print(x.first);     cerr <<  , ;     __print(x.second);     cerr <<  } ;   }   template <typename T>   void __print(const T &x) {     long long f = 0;     cerr <<  { ;     for (auto &i : x) cerr << (f++ ?  ,  :   ), __print(i);     cerr <<  } ;   }   void _print() { cerr <<  ] n ; }   template <typename T, typename... V>   void _print(T t, V... v) {     __print(t);     if (sizeof...(v)) cerr <<  ,  ;     _print(v...);   }   long long Power(long long a, long long n, long long mod) {     long long res = 1;     while (n) {       if (n % 2 != 0) {         res = ((res % mod) * (a % mod)) % mod;         n--;       } else {         a = ((a % mod) * (a % mod)) % mod;         n /= 2;       }     }     return res;   }   void AllPossibilities(vector<long long> &arr, vector<long long> &answers,                         long long index, long long sum) {     if (index == arr.size()) {       answers.push_back(sum);       return;     }     AllPossibilities(arr, answers, index + 1, sum + arr[index]);     AllPossibilities(arr, answers, index + 1, sum);   }   bool isPrime(long long n) {     if (n <= 1) return false;     if (n <= 3) return true;     if (n % 2 == 0 || n % 3 == 0) return false;     for (long long i = 5; i * i <= n; i = i + 6)       if (n % i == 0 || n % (i + 2) == 0) return false;     return true;   }   long long getSum(long long n) {     long long sum = 0;     while (n != 0) {       sum = sum + n % 10;       n = n / 10;     }     return sum;   }   long long myceil(long long n, long long x) {     long long y;     if (n % x == 0) {       y = n / x;       return y;     } else {       y = n / x + 1;       return y;     }   }   long long md = 1000000007;   vector<long long> fact, inv;   void inverse(long long n) {     if (n >= inv.size()) {       long long size = inv.size();       size = size == 0 ? 1 : size;       inv.resize(n + 1);       inv[0] = 1;       for (long long i = size; i <= n; i++) inv[i] = Power(fact[i], md - 2, md);     }   }   void factorial(long long n) {     if (n >= fact.size()) {       long long size = fact.size();       size = size == 0 ? 1 : size;       fact.resize(n + 1);       fact[0] = 1;       for (long long i = size; i <= n; i++) fact[i] = (fact[i - 1] * i) % md;     }   }   long long ncr(long long n, long long r) {     return (((fact[n] * inv[r]) % md) * inv[n - r]) % md;   }   long long primes[1300000];   void Sieve() {     bool IsPrime[1300000];     memset(IsPrime, true, sizeof(IsPrime));     for (long long p = 2; p * p < 1300000; p++) {       if (IsPrime[p] == true) {         for (long long i = p * p; i < 1300000; i += p) IsPrime[i] = false;       }     }     long long index = 0;     for (long long p = 2; p < 1300000; p++)       if (IsPrime[p]) {         primes[index] = p;         index++;       }   }   void q1();   void q2();   void q3();   void q4();   void q5();   void pr(vector<vector<long long>> v);   int32_t main() {     q1();     return 0;   }   void q1() {     long long n;     cin >> n;     long long sum = 0;     for (long long i = 0; i < n; i++) {       long long x;       cin >> x;       sum += x;     }     long long resp = 0;     for (long long i = 1; i <= 5; i++)       if ((i + sum) % (n + 1) != 1) resp++;     cout << resp;   }   void pr(vector<vector<long long>> v) {}   void q2() {     long long n;     cin >> n;     long long arr[n];     for (long long i = 0; i < n; i++) cin >> arr[i];     sort(arr, arr + n);     bool set = true;     for (long long i = 0; i < n - 1; i++) {       if (arr[i] == arr[i + 1]) {         set = false;         break;       }     }     if (set)       cout <<  NO             <<   n ;     else {       cout <<  YES             <<   n ;     }   }   