#include <queue>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

int main(){
  const int n = getInt();
  vector<int> a(n);
  REP(i,n) a[i] = getInt();

  for(int i = 1; i <= 100; i++){
    if(100 % i != 0) continue;
    const int k = 100 / i;
    bool ok = true;
    REP(j,n) if(a[j] % k != 0)
      ok = false;
    if(ok){
      printf("%d\n", i);
      return 0;
    }
  }

  return 0;
}