#include <bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin >> n ;
int a[n] ;
int ost=0 ;
for(int i=0 ;i<n ; i++){
cin >> a[i] ;
ost+=a[i]%3 ;
}
sort(a,a+n) ;
if(a[0]!=0){
cout << -1 ;
return 0 ;
}
int izb[n]={0} ;
int t=0 ;
ost=ost%3 ;
if(ost!=0){
for(int i=1 ; i<n ; i++){
if(a[i]%3==ost){
t=1 ;
izb[i]=1 ;
break ;
}
}
if(t==0){
for(int i=1 ; i<n ; i++){
if(a[i]%3==3-ost){
t++ ;
izb[i]=1 ;
}
if(t==2){
break ;
}
}
}
}
int br=0 ;
for(int i=0 ; i<n ; i++){
if(a[i]==0){
br++ ;
}
}
if(br==n-t){
cout << 0 ;
return 0 ;
}
else{
for(int i=n-1 ; i>=0; i--){
if(izb[i]==0){
cout << a[i] ;
}
}
}
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |