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 ≤ 103). The next line contains n integers a1, a2, ..., an (ai = 0 or ai = 5). Number ai 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.
 
import java.awt.Point;
import java.io.*;
import java.math.BigInteger;
import java.util.*;

import org.omg.CORBA.INTF_REPOS;

import static java.lang.Math.*;
 
public class A implements Runnable{
       
        final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
       
        BufferedReader in;
        PrintWriter out;
        StringTokenizer tok = new StringTokenizer("");
       
        void init() throws FileNotFoundException{
                if (ONLINE_JUDGE){
                        in = new BufferedReader(new InputStreamReader(System.in));
                        out = new PrintWriter(System.out);
                }else{
                        in = new BufferedReader(new FileReader("input.txt"));
                        out = new PrintWriter("output.txt");
                }
        }
       
        String readString() throws IOException{
                while(!tok.hasMoreTokens()){
                        try{
                                tok = new StringTokenizer(in.readLine());
                        }catch (Exception e){
                                return null;
                        }
                }
                return tok.nextToken();
        }
       
        int readInt() throws IOException{
                return Integer.parseInt(readString());
        }
       
        long readLong() throws IOException{
                return Long.parseLong(readString());
        }
       
        double readDouble() throws IOException{
                return Double.parseDouble(readString());
        }
       
        public static void main(String[] args){
                new Thread(null, new A(), "", 256 * (1L << 20)).start();
        }
        
        void solve() throws IOException{
            int n = readInt();
            
            int[] arr= new int[n];
            int x = 0;
            int y = 0;
            
            boolean check = false;
            for (int i =0; i < n; i++) {
                arr[i] = readInt();
                if (arr[i] == 0) {
                    check = true;
                    x++;
                }
                if (arr[i] == 5){
                    y++;
                }
            }
            if (x == 0){
                out.println("-1");
                return;
            }
            if (y < 9){
                out.println("0");
                return;
            }
            
            for (int i = 1; 9*i <= y; i++){
                out.print("555555555");
            }
            
            for (int i = 0; i < x; i++) {
                out.print("0");
            }
            
            
        }
       
        long timeBegin, timeEnd; 
        void time(){
                timeEnd = System.currentTimeMillis();
                System.err.println("Time = " + (timeEnd - timeBegin));
                timeBegin = timeEnd;
        }
       
        public void run(){
                try{
                        timeBegin = System.currentTimeMillis();
                        init();
                        solve();
                        out.close();
                        time();
                }catch (Exception e){
                        e.printStackTrace(System.err);
                        System.exit(-1);
                }
        }
}