#include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   #pragma GCC target( avx,avx2,fma )   using namespace std;   const int mod1 = 1000000007;   long long gcd(long long a, long long b) {     long long c = a % b;     while (c != 0) {       a = b;       b = c;       c = a % b;     }     return b;   }   long long issub(string a, string b) {     if (a.find(b) != string::npos)       return 1;     else       return 0;   }   long long expo(long long a, long long b) {     long long res = 1;     while (b > 0) {       if (b & 1) res = res * a % mod1;       a = a * a % mod1;       b >>= 1;     }     return res;   }   int32_t lcm(long long n1, long long n2) {     long long max = (n1 > n2) ? n1 : n2;     do {       if (max % n1 == 0 && max % n2 == 0) {         return max;       } else         ++max;     } while (true);   }   string operator*(string a, unsigned long long b) {     string output =   ;     while (b--) output += a;     return output;   }   bool isPerfectSquare(long long n) {     for (long long i = 1; i * i <= n; i++) {       if ((n % i == 0) && (n / i == i)) {         return true;       }     }     return false;   }   int32_t main() {     ios_base::sync_with_stdio(false), cin.tie(NULL);     ;     long long t, a = 0, x;     cin >> t;     map<long long, long long> m;     for (long long i = 0; i < t; i++) {       cin >> x;       m[x]++;       a = max(a, m[x]);     }     cout << a;     return 0;   }   