A. Xenia and Divisors codeforces-problem-342A

A. Xenia and Divisors

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Xenia the mathematician has a sequence consisting of n (n is divisible by 3) positive integers, each of them is at most 7. She wants to split the sequence into groups of three so that for each group of three a, b, c the following conditions held:

• a < b < c;
• a divides b, b divides c.

Naturally, Xenia wants each element of the sequence to belong to exactly one group of three. Thus, if the required partition exists, then it has  groups of three.

Help Xenia, find the required partition or else say that it doesn't exist.

Input

The first line contains integer n (3 ≤ n ≤ 99999) — the number of elements in the sequence. The next line contains n positive integers, each of them is at most 7.

It is guaranteed that n is divisible by 3.

Output

If the required partition exists, print  groups of three. Print each group as values of the elements it contains. You should print values in increasing order. Separate the groups and integers in groups by whitespaces. If there are multiple solutions, you can print any of them.

If there is no solution, print -1.

Examples

input

6
1 1 1 2 2 2

output

-1

input

6
2 2 1 1 4 6

output

1 2 4
1 2 6

题意：

输入n个数字，分类 ，输出n/3组 a,b,c 形式数据，b%a==0，c%b==0，a!=b!=c.

若不能分类则输出-1。

想法：最大数字为7  只有三种组合可能  

1，2，6

1，2，4

1，3，6

N（1）=N（2）+N（3）

N（1）=N（4）+N（6）

N（136）=N（3）

N（146）=N（4）

N（126）=N（6）-N（3）=N（2）-N（4）

注意N（3）<=N（6），N（4）<=N（2）

#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    int term,save[7];
    memset(save,0,sizeof(save));
    int flag=1;
    while(n--)
    {
        scanf("%d",&term);
        save[term]++;
        if(term==5||term==7)flag=0;
    }
    if(flag&&save[1]==save[2]+save[3]&&save[1]==save[4]+save[6]&&save[6]>=save[3])
    {//注意save[6]>=save[3]的条件，可换为save[2]>=save[4] 避免 1 1 2 3 4 4
        for(int i=0;i<save[6]-save[3];i++)
            printf("1 2 6\n");
        for(int i=0;i<save[4];i++)
            printf("1 2 4\n");
        for(int i=0;i<save[3];i++)
            printf("1 3 6\n");
    }
    else printf("-1\n");
}
/*注意点：
在输入数据时考虑数据是否要被复用，若不需要复用，则可考虑用单个变量反复赋值来增加效率。*/