#include <bits/stdc++.h>
using namespace std;
mt19937 Rand(time(0));
const int maxn = 4e5 + 5;
const long long maxc = 1e9 + 7;
int n;
int a[maxn];
vector<int> f[maxn];
int resRow, resCol;
vector<vector<int> > ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = (1); i <= (n); ++i) cin >> a[i];
  sort(a + 1, a + n + 1);
  int cnt = 0, sum = 0;
  for (int i = (1); i <= (n); ++i) {
    int j = i;
    while (a[j] == a[i] && j <= n) ++j;
    f[j - i].push_back(a[i]);
    i = j - 1;
    ++cnt;
  }
  for (int numRow = 1; numRow * numRow <= n; ++numRow) {
    sum += f[numRow].size() * numRow;
    cnt -= f[numRow].size();
    int numCol = (sum + cnt * numRow) / numRow;
    if (numCol < numRow) continue;
    if (numRow * numCol > resRow * resCol) {
      resRow = numRow;
      resCol = numCol;
    }
  }
  cout << resRow * resCol << "\n";
  cout << resRow << " " << resCol << "\n";
  for (int i = (resRow + 1); i <= (n); ++i) {
    for (auto x : f[i]) f[resRow].push_back(x);
  }
  ans.assign(resRow + 1, vector<int>());
  int pos = 0;
  for (int i = (resRow); i >= (1); --i) {
    for (auto x : f[i]) {
      for (int j = (1); j <= (i); ++j) {
        ans[pos % resRow].push_back(x);
        ++pos;
        if (pos == resRow * resCol) break;
      }
      if (pos == resRow * resCol) break;
    }
    if (pos == resRow * resCol) break;
  }
  for (int i = (0); i <= (resRow - 1); ++i) {
    for (int j = (0); j <= (resCol - 1); ++j) {
      cout << ans[i][(j - i + resCol) % resCol] << " ";
    }
    cout << "\n";
  }
  return 0;
}
