#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
clock_t tStart = clock();
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
int b[2000005];
int c[2000005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t;
  cin >> t;
  int a[t], p = -1;
  for (int i = 0; i < t; ++i) {
    cin >> a[i];
    ++b[a[i]];
    p = max(a[i], p);
  }
  int x = 1;
  for (int i = 1; i <= p; ++i) {
    if (i * 4 != b[i]) {
      x = i;
      break;
    }
  }
  for (int i = 1; i * i <= t; ++i) {
    if (t % i == 0) {
      int n = i;
      int m = t / i;
      int aa = n + m - p - 2;
      int y = aa + 2 - x;
      memset(c, 0, sizeof(c));
      bool ok = 0;
      for (int j = 1; j <= n; ++j) {
        for (int k = 1; k <= m; ++k) {
          c[abs(j - x) + abs(k - y)]++;
        }
      }
      for (int j = 0; j <= p; ++j) {
        if (c[j] != b[j]) {
          ok = 1;
          break;
        }
      }
      if (!ok) {
        cout << n << " " << m << '\n';
        cout << x << " " << y;
        return 0;
      }
      memset(c, 0, sizeof(c));
      ok = 0;
      swap(n, m);
      for (int j = 1; j <= n; ++j) {
        for (int k = 1; k <= m; ++k) {
          c[abs(j - x) + abs(k - y)]++;
        }
      }
      for (int j = 0; j <= p; ++j) {
        if (c[j] != b[j]) {
          ok = 1;
          break;
        }
      }
      if (!ok) {
        cout << n << " " << m << '\n';
        cout << x << " " << y;
        return 0;
      }
    }
  }
  cout << -1;
}
