Problem: As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's twins help him: they've already made n snowballs with radii equal to r1, r2, ..., rn. To make a snowman, one needs any three snowballs whose radii are pairwise different. For example, the balls with radii 1, 2 and 3 can be used to make a snowman but 2, 2, 3 or 2, 2, 2 cannot. Help Sergey and his twins to determine what maximum number of snowmen they can make from those snowballs.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of snowballs. The next line contains n integers — the balls' radii r1, r2, ..., rn (1 ≤ ri ≤ 109). The balls' radii can coincide.

Output

Print on the first line a single number k — the maximum number of the snowmen. Next k lines should contain the snowmen's descriptions. The description of each snowman should consist of three space-separated numbers — the big ball's radius, the medium ball's radius and the small ball's radius. It is allowed to print the snowmen in any order. If there are several solutions, print any of them.

Examples

Input

7
1 2 3 4 5 6 7


Output

2
3 2 1
6 5 4


Input

3
2 2 3


Output

0

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author Mohammad Jamel
 */
public class PNum1 {

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(in.readLine());
        HashMap<Integer, Integer> list = new HashMap<>();
        String line = in.readLine();
        StringTokenizer st = new StringTokenizer(line);
        PriorityQueue<pair>list1=new PriorityQueue<>();
        for (int i = 0; i < n; i++) {
            int x = Integer.parseInt(st.nextToken());
            Integer y = list.get(x);
            if (y == null) {
                list.put(x, 1);
            } else {
                list.put(x, ++y);
            }
        }
        for (Integer key : list.keySet()) {
            list1.add(new pair(key, list.get(key)));
        }
        if(list1.size()<3){
            System.out.println("0");
            return ;
        }
        int count=0;
        StringBuilder s=new StringBuilder();
        while(list1.size()>=3){
            count++;
        pair a=list1.remove();
        pair b=list1.remove();
        pair c=list1.remove();
            
            int []oo={a.first,b.first,c.first};
            Arrays.sort(oo);
            s.append(oo[2]).append(" ").append(oo[1]).append(" ").append(oo[0]).append("\n");
            if(--a.Second>0)list1.add(a);
            if(--b.Second>0)list1.add(b);
            if(--c.Second>0)list1.add(c);
        }
        System.out.println(count);
        System.out.print(s);
    }
}

class pair implements Comparable<pair>{
   public  int first;
   public  int Second;

    public pair() {
    }

    public pair(int first, int Second) {
        this.first = first;
        this.Second = Second;
    }

    @Override
    public int compareTo(pair t) {
        if(Second<t.Second){
        return 1;
        }else if(Second>t.Second){
        return -1;
        }else{
        if(first<t.first)return 1;
        else if(first>t.first){return -1;}
        }
        return 0;
    }
    
}
//Url to problem  http://codeforces.com/contest/140/problem/C