#include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int b[50000][3];
struct Node {
  int v, x;
};
bool operator<(Node a, Node b) { return a.x < b.x; }
priority_queue<Node> q;
int main() {
  while (cin >> n) {
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    Node tmp, t[3];
    a[n] = -1;
    tmp.v = a[0];
    tmp.x = 1;
    for (int i = 1; i <= n; i++)
      if (a[i] == a[i - 1]) {
        tmp.x++;
      } else {
        q.push(tmp);
        tmp.v = a[i];
        tmp.x = 1;
      }
    int i = 0;
    while (1) {
      bool flag = 0;
      for (int j = 0; j < 3; j++) {
        if (q.empty()) {
          flag = 1;
          break;
        }
        t[j] = q.top();
        q.pop();
      }
      if (flag) break;
      for (int j = 0; j < 3; j++) {
        b[i][j] = t[j].v;
        t[j].x--;
        if (t[j].x) q.push(t[j]);
      }
      sort(b[i], b[i] + 3);
      i++;
    }
    cout << i << endl;
    for (int k = 0; k < i; k++)
      cout << b[k][2] << " " << b[k][1] << " " << b[k][0] << endl;
  }
  return 0;
}
