20250710
# import heapq as hq
# n=int(input())
# a=[]
# q=[]
# for i in range(n):
# x,y=map(int,input().split())
# a.append((x,y))
# a.sort()
# s=0
# for i in range(n):
# if q and q[0]<=a[i][0]:
# hq.heappop(q)
# hq.heappush(q,a[i][1])
# s=max(s,len(q))
# print(s)
import math
n=int(input())
a=list(map(int,input().split()))
if sum(a)==0:
print('0')
exit()
for i in range(n):
for j in range(n-1):
if a[j+1]==0:
if a[j]*10**(10-len(str(a[j])))<a[j+1]*10**(10-len(str(a[j+1]))):
a[j],a[j+1]=a[j+1],a[j]
elif a[j]*10**(10-len(str(a[j])))==a[j+1]*10**(10-len(str(a[j+1]))):
x=a[j]*(10*math.trunc(math.log10(a[j+1])))+a[j+1]
y=a[j+1]*(10*math.trunc(math.log10(a[j])))+a[j]
if x<y:
a[j], a[j + 1] = a[j + 1], a[j]
for x in a:
print(x,end='')