#include <bits/stdc++.h>
using namespace std;
long long read() {
  int f = 1;
  long long res = 0;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = -f;
  } while (ch < '0' || ch > '9');
  do {
    res = res * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  return f == 1 ? res : -res;
}
void fast_io() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const int N = 1000010;
int mod = 1000000007;
const long long INF = 1e18;
int n, m;
int A[N], B[N], C[N];
char str[N];
int head[N], to[N * 2], nxt[N * 2], tot = 1;
void addEdge(int u, int v, int val) {
  tot++;
  nxt[tot] = head[u];
  to[tot] = v;
  head[u] = tot;
}
template <class T>
T mmax(T a, T b) {
  return a < b ? b : a;
}
template <class T>
T mmin(T a, T b) {
  return a < b ? a : b;
}
int countOne(long long set) {
  int res = 0;
  while (set) {
    res++;
    set &= set - 1;
  }
  return res;
}
bool contain(int set, int i) { return (set & (1 << i)) > 0; }
long long myPow(long long a, int p) {
  if (p == 0) return 1;
  long long res = myPow(a, p / 2);
  res *= res;
  res %= mod;
  if (p % 2 == 1) {
    res *= a;
    res %= mod;
  }
  return res;
}
void addMode(long long &a, long long b) {
  a = (a + b) % mod;
  if (a < 0) a += mod;
}
long long mul(long long a, long long b) {
  long long res = a * b % mod;
  if (res < 0) res += mod;
  return res;
}
template <class T>
void mySwap(T &a, T &b) {
  T tmp = a;
  a = b;
  b = tmp;
}
void solve() {
  cin >> n;
  map<int, int> cnt;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    cnt[a]++;
  }
  vector<vector<int>> value_cnt(n + 1);
  for (auto it : cnt) {
    value_cnt[it.second].push_back(it.first);
  }
  vector<int> geq(n + 1);
  geq[n] = value_cnt[n].size();
  for (int i = n - 1; i >= 1; i--) {
    geq[i] = geq[i + 1] + value_cnt[i].size();
  }
  int best = 0, best_a, best_b;
  int tot = 0;
  for (int a = 1; a <= n; a++) {
    tot += geq[a];
    int b = tot / a;
    if (a <= b && a * b > best) {
      best = a * b;
      best_a = a;
      best_b = b;
    }
  }
  vector<vector<int>> res(best_a, vector<int>(best_b, 0));
  int x = 0, y = 0;
  for (int i = n; i > 0; i--) {
    for (int value : value_cnt[i])
      for (int j = 0; j < min(best_a, i); j++) {
        if (res[x][y] != 0) x = (x + 1) % best_a;
        if (res[x][y] == 0) res[x][y] = value;
        x = (x + 1) % best_a;
        y = (y + 1) % best_b;
      }
  }
  cout << best << endl;
  cout << best_a << " " << best_b << endl;
  for (int i = 0; i < best_a; i++) {
    for (int j = 0; j < best_b; j++) cout << res[i][j] << ' ';
    cout << endl;
  }
}
int main() {
  fast_io();
  int T = 0;
  for (int t = 0; t < T; t++) {
  }
  solve();
  return 0;
}
