#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <stack>

int N;
int A[128];

int gcd(int a, int b) {
  while( b != 0 ) {
    a %= b;
    std::swap(a, b);
  }
  return a;
}

int main() {

  std::cin >> N;
  for(int i = 0; i < N; ++i) std::cin >> A[i];

  int g = A[0];
  for(int i = 0; i < N; ++i) {
    g = gcd(g, A[i]);
  }

  for(int i = 0; i < N; ++i) A[i] /= g;

  int res = 0;
  for(int i = 0; i < N; ++i) res += A[i];

  printf("%d\n", res);
  
  return 0;
}