B - Jeff and Digits

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_i represents 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.

Examples

Input

4
5 0 5 0

Output

0

Input

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

Output

5555555550

Note

In the first test you can make only one number that is a multiple of 90 — 0.

In the second test you can make number 5555555550, it is a multiple of 90.

简单的找规律水题，开始想的时候想复杂了，想到了用找下一个排列的方法结合sstream做，然后突然想到只找最大，就去用计算器找规律， 5的个数是9的倍数，并且末尾不能为0就ok，注意的是如果没有0就得输出-1；

#include"iostream"
#include"cstring" 
using namespace std;
int main() 
{
	int n;
	int a[10];
	while(cin >> n)
	{
		memset(a,0,sizeof(a));
		for(int i = 0;i <n;i ++)
		{
			int x;
			cin >>x;
			a[x]++;
		}
		int y=a[5]/9;
		if(y == 0 )
		{
			if(a[0] == 0)
			{
				cout<<-1<<endl;
			}
			else
			{
				cout<<0<<endl;
			}
			continue;
		}
		if(a[0] != 0)
		{
			for(int i =0;i < y*9;i ++)
			{
			cout<<5; 
			}
			for(int i = 0;i < a[0] ; i ++)
			{
				cout<<0;
			} 
			cout<<endl;
		}
		else
		{
			cout<<-1<<endl;
		}
		
	}
	return 0;
}