No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Jeff and Digits

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputJeff'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^{3}). The next line contains *n* integers *a*_{1}, *a*_{2}, ..., *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.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/11/2021 15:50:26 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|