CF214B.Hometask

Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you?

You are given a set of digits, your task is to find the maximum integer that you can make from these digits. The made number must be divisible by 2, 3, 5 without a residue. It is permitted to use not all digits from the set, it is forbidden to use leading zeroes.

Each digit is allowed to occur in the number the same number of times it occurs in the set.

弗里克非常喜欢数学课，因此他不像鲁比克那样去上课。但现在弗里克想在数学考试中取得好成绩。为此，他的数学老师伊万诺娃女士给他布置了一道新题目。弗里克立刻就解出了这道题。你也能做到吗？

给你一组数字，你的任务是用这些数字组成一个尽可能大的整数。该整数必须能被 $2$、$3$、$5$ 整除（即余数为 $0$）。允许不使用集合中的全部数字，但禁止使用前导零。

每个数字在所组成的数中出现的次数，不得超过它在给定集合中出现的次数。

A single line contains a single integer n (1 ≤ n ≤ 100000) — the number of digits in the set. The second line contains n digits, the digits are separated by a single space.

一行包含一个整数 $n$（$1 \leq n \leq 100000$）——集合中数字的个数。
第二行包含 $n$ 个数字，数字之间用单个空格分隔。

On a single line print the answer to the problem. If such number does not exist, then you should print -1.

在一行中输出问题的答案。如果这样的数不存在，则应输出 -1。

In the first sample there is only one number you can make — 0. In the second sample the sought number is 5554443330. In the third sample it is impossible to make the required number.

在第一个样例中，你只能构造出一个数字——0。在第二个样例中，所求的数字是 5554443330。在第三个样例中，无法构造出所要求的数字。