// Problem: No.2221 Set X
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2221
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

int n;
void solve() {
  cin >> n;
  vector<int> a(n);
  for (auto &it : a) cin >> it;
  int ans = 2 * n, X = 1;
  for (int x = 1; x <= 2 * n; x++) {
    int cnt = 0;
    for (int y = 0; x * y <= a[n - 1]; y++) {
      int t = lower_bound(all(a), x * (y + 1)) - lower_bound(all(a), x * y);
      cnt += !!t;
    }
    if ((x + 1) * cnt < ans) {
      ans = (x + 1) * cnt;
      X = x;
    }
  }
  cout << X << "\n" << ans << "\n";
}

int main() {
  fastio;
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}