#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> a(n);
  map<long long, long long> count;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    count[a[i]]++;
  }
  vector<pair<long long, long long>> arr;
  for (auto i : count) {
    arr.push_back({i.second, i.first});
  }
  sort(arr.begin(), arr.end());
  long long limit = arr.back().first;
  long long sum = 0;
  long long row = 0, column = 0, ans = 0;
  long long ptr = -1;
  for (long long i = 1; i <= (long long)arr.size(); i++) {
    while ((ptr + 1 < arr.size()) && (arr[ptr + 1].first < i)) {
      sum += arr[ptr + 1].first;
      ptr++;
    }
    long long t = ((long long)arr.size() - ptr - 1 + (sum / i));
    long long val = ((long long)arr.size() - ptr - 1 + (sum / i)) * i;
    if (t < i) continue;
    if (val > ans) {
      ans = val;
      row = i;
      column = arr.size() - ptr - 1 + (sum / i);
    }
  }
  for (long long i = 0; i < arr.size(); i++)
    arr[i].first = min(arr[i].first, row);
  long long x = 0, y = 0, idx = (long long)arr.size() - 1;
  vector<vector<long long>> temp(column, vector<long long>(row, 0)),
      res(column, vector<long long>(row, 0));
  cout << ans << '\n';
  cout << column << " " << row << '\n';
  while (ans--) {
    temp[x][y] = arr[idx].second;
    arr[idx].first--;
    y++;
    if (y >= row) {
      x++;
      y = 0;
    }
    if (arr[idx].first == 0) {
      idx--;
    }
  }
  long long shift = 0;
  for (long long i = 0; i < row; i++) {
    for (long long j = 0; j < column; j++) {
      res[(j + shift) % column][i] = temp[j][i];
    }
    shift++;
  }
  for (long long i = 0; i < column; i++) {
    for (long long j = 0; j < row; j++) {
      cout << res[i][j] << " ";
    }
    cout << '\n';
  }
  return 0;
}
