func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = (int)1e9 + 7;   const int FFTMOD = 119 << 23 | 1;   const int INF = (int)1e9 + 23111992;   const long long LINF = (long long)1e18 + 23111992;   const long double PI = acos((long double)-1);   const long double EPS = 1e-9;   inline long long gcd(long long a, long long b) {     long long r;     while (b) {       r = a % b;       a = b;       b = r;     }     return a;   }   inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }   inline long long fpow(long long n, long long k, int p = MOD) {     long long r = 1;     for (; k; k >>= 1) {       if (k & 1) r = r * n % p;       n = n * n % p;     }     return r;   }   template <class T>   inline int chkmin(T& a, const T& val) {     return val < a ? a = val, 1 : 0;   }   template <class T>   inline int chkmax(T& a, const T& val) {     return a < val ? a = val, 1 : 0;   }   inline unsigned long long isqrt(unsigned long long k) {     unsigned long long r = sqrt(k) + 1;     while (r * r > k) r--;     return r;   }   inline long long icbrt(long long k) {     long long r = cbrt(k) + 1;     while (r * r * r > k) r--;     return r;   }   inline void addmod(int& a, int val, int p = MOD) {     if ((a = (a + val)) >= p) a -= p;   }   inline void submod(int& a, int val, int p = MOD) {     if ((a = (a - val)) < 0) a += p;   }   inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }   inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }   inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }   inline int sign(long double x, long double y) { return sign(x - y); }   mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());   inline int mrand() { return abs((int)mt()); }   void chemthan() {     int n;     cin >> n;     vector<long long> a(n);     for (int i = (0); i < (n); ++i) cin >> a[i];     vector<int> vals;     for (int i = (0); i < (n); ++i) vals.push_back(i);     vector<int> pv_order(n), dp(n + 1);     for (int k = (1); k < (63); ++k) {       sort((vals).begin(), (vals).end(), [&](int u, int v) {         return make_pair(a[u] & (1LL << k) - 1, pv_order[u]) <                make_pair(a[v] & (1LL << k) - 1, pv_order[v]);       });       int x = 0, y = 0;       for (int i = (0); i < (n); ++i) {         if (!(((a[i]) >> (k - 1)) & 1)) {           x++;         }       }       vector<int> st(n + 1 << 1);       auto upd = [&](int p, int val) {         for (st[p += n + 1] = val; 1 < p;)           p >>= 1, st[p] = min(st[p << 1], st[p << 1 | 1]);       };       auto query = [&](int l, int r) {         int res = INF;         for (l += n + 1, r += n + 2; l < r; l >>= 1, r >>= 1) {           if (l & 1) chkmin(res, st[l++]);           if (r & 1) chkmin(res, st[--r]);         }         return res;       };       for (int i = (0); i < (n + 1); ++i) upd(i, dp[i]);       vector<int> ndp(n + 1);       int lo = 0;       int hi = n;       if (1 < k && !(((a[vals[0]]) >> (k - 1)) & 1)) {         hi = pv_order[vals[0]] - 1;       }       ndp[0] = x + (1 < k ? query(lo, hi) : 0);       for (int i = (1); i < (n + 1); ++i) {         int lo = pv_order[vals[i - 1]];         int hi = n;         if (i < n && (((a[vals[i - 1]]) >> (k - 1)) & 1) ==                          (((a[vals[i]]) >> (k - 1)) & 1)) {           hi = pv_order[vals[i]] - 1;         }         if (!(((a[vals[i - 1]]) >> (k - 1)) & 1)) {           x--;           ndp[i] = x + (1 < k ? query(lo, hi) : 0);           if (i == n || (((a[vals[i]]) >> (k - 1)) & 1)) {             chkmin(ndp[i], n - y + (1 < k ? query(0, hi) : 0));           }         } else {           y++;           ndp[i] = n - y + (1 < k ? query(lo, hi) : 0);         }       }       for (int i = (0); i < (n); ++i) {         pv_order[vals[i]] = i + 1;       }       dp = ndp;     }     cout << dp.back() <<   n ;   }   int main(int argc, char* argv[]) {     ios_base::sync_with_stdio(0), cin.tie(0);     if (argc > 1) {       assert(freopen(argv[1],  r , stdin));     }     if (argc > 2) {       assert(freopen(argv[2],  wb , stdout));     }     chemthan();     cerr <<   nTime elapsed:   << 1000 * clock() / CLOCKS_PER_SEC <<  ms n ;     return 0;   }   