#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  map<int, int> a;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    a[x] += 1;
  }
  vector<pair<int, int>> p, pt;
  for (auto it : a) {
    p.emplace_back(it.second, it.first);
  }
  sort(p.begin(), p.end());
  pt = p;
  int R = -1;
  int E = n;
  int T = 0;
  int mx = 0;
  for (int i = n; i >= 1; i--) {
    if (1LL * i * i <= E && mx <= E / i * i) {
      mx = E / i * i;
      R = i;
    }
    while (pt.size() && pt.back().first == i) {
      pt.pop_back();
      T++;
    }
    E -= T;
  }
  int C = mx / R;
  cout << mx << endl;
  cout << R << ' ' << C << endl;
  vector<int> t;
  vector<vector<int>> res(R, vector<int>(C));
  for (auto x : p) {
    for (int i = 0; i < min(R, x.first); i++) t.push_back(x.second);
  }
  for (int j = 0; j < C; j++) {
    for (int i = 0; i < R; i++) {
      res[i][(j + i) % C] = t.back();
      t.pop_back();
    }
  }
  for (int i = 0; i < R; i++) {
    for (int j = 0; j < C; j++) {
      cout << res[i][j] << ' ';
    }
    cout << '\n';
  }
  return 0;
}
