CodeForces 352A Jeff and Digits

Description

Jeff's got n cards, each card contains either digit 0, or digit 5. Jeff can choose several cards and put them in a line so that he gets some number. What is the largest possible number divisible by 90 Jeff can make from the cards he's got?

Jeff must make the number without leading zero. At that, we assume that number 0 doesn't contain any leading zeroes. Jeff doesn't have to use all the cards.

Input

The first line contains integer n(1 ≤ n ≤ 10³). The next line contains n integers a₁, a₂, ..., a_n (a_i = 0 or a_i = 5). Number a_irepresents the digit that is written on the i-th card.

Output

In a single line print the answer to the problem — the maximum number, divisible by 90. If you can't make any divisible by 90 number from the cards, print -1.

Sample Input

Input

4
5 0 5 0

Output

0

Input

11
5 5 5 5 5 5 5 5 0 5 5

Output

5555555550

这个题有规律的：由于输入的数字中只有0和5两个数字，所以若是能整除90，则末尾必有一个0，而且几个5才能整除90呢，当然最少为9个5，则能整除90的5的个数必是9的倍数，这就是题眼所在，所以只需判断0的个数>=1,5的个数>=n*9；

#include <iostream>
using namespace std;

int main()
{
    int n;
    int a[1005];
    int num5,num0,flag;
    while(cin>>n)
    {
        num5 = 0;
        num0 = 0;
        for(int i = 0; i<n; i++)
        {
            cin>>a[i];
            if(a[i] == 5)
                num5++;
            else if(a[i] == 0)
                num0++;
        }
        flag = num5/9;//5的个数必须是9的倍数
        if(!num0)//必须含有0最好因为为0
            cout<<"-1"<<endl;
        else
        {
            if(flag)
            {
                for(int i = 0; i<flag*9; i++)
                    cout<<"5";
                for(int i = 0; i<num0; i++)
                    cout<<"0";
            }
            else
                cout<<"0";//最后一位必须为0
            cout<<endl;
        }
    }
    return 0;
}