#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;
int n, k;
int arr[N];

void solve()
{
    for(int i = 1; i <= n; i++){
        scanf("%d", &arr[i]);
    }
    int maxk = n / 20;
    int mink = 2;
    while(mink < maxk && n % maxk != 0)
    {
        maxk--;
    }
    cout << maxk;
}

int main()
{
    cin >> n;
    solve();
    return 0;
}