#include <bits/stdc++.h>
using namespace std;
typedef struct tuple_t {
  int a, b, c;
  tuple_t() {}
  tuple_t(int a_, int b_, int c_) : a(a_), b(b_), c(c_) {}
} tuple_t;
int main() {
  ios::sync_with_stdio(false);
  map<int, int> tb;
  map<int, int>::iterator iter;
  int n, x, k;
  tuple_t tp;
  pair<int, int> p1, p2, p3;
  vector<tuple_t> ans;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &x);
    ++tb[x];
  }
  priority_queue<pair<int, int> > Q;
  for (iter = tb.begin(); iter != tb.end(); ++iter)
    Q.push(make_pair(iter->second, iter->first));
  while (Q.size() >= 3) {
    p1 = Q.top();
    Q.pop();
    p2 = Q.top();
    Q.pop();
    p3 = Q.top();
    Q.pop();
    ans.push_back(tuple_t(p1.second, p2.second, p3.second));
    if (--p1.first) Q.push(p1);
    if (--p2.first) Q.push(p2);
    if (--p3.first) Q.push(p3);
  }
  n = ((int)(ans).size());
  printf("%d\n", n);
  int a, b, c;
  for (int i = 0; i < n; ++i) {
    a = max(ans[i].a, max(ans[i].b, ans[i].c));
    c = min(ans[i].a, min(ans[i].b, ans[i].c));
    b = ans[i].a + ans[i].b - a + ans[i].c - c;
    printf("%d %d %d\n", a, b, c);
  }
  return 0;
}
