#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;
int cnt[N];

void sieve() {
    for (int i = 1; i < N; ++i) {
        for (int j = i; j < N; j += i) {
            ++cnt[j];
        }
    }
}

int trau(const vector<int>& a) {
    int max = 0;
    int n = a[0];
    
    for (int num : a) {
         int d = cnt[num];
         if (d > max) {
           max = d;
             n = num;
        }
    }
    
    return n;
}

int main() {
    sieve();
    vector<int> a = {10, 24, 18, 30, 16, 12};
    int res = trau(a);
    cout << res << endl;
    return 0;
}