#!/usr/bin/env python3
import sys
import itertools

#200 000 a do 1e9

def sort_and_save_index(seq):
    return [(j, i) for i,j in enumerate(seq)]

def find_pattern(pattern, seq):
    i = 0
    j = 0
    k = 0
    while i < len(seq):
        j=0
        while j < len(seq):
            k=0
            while k < len(seq):
                if pattern(seq[i][0],seq[j][0],seq[k][0]):
                    if (seq[i][1] < seq[j][1]) and (seq[j][1] < seq[k][1]):
                        #print(seq[i], seq[j], seq[k])
                        return True
                k+=1
            j+=1
        i+=1
    return False

def solve():
    patterns = {
            (1, 3, 2):lambda x,y,z: x<y and y>z and x<z, 
            (1, 1, 1):lambda x,y,z: x==y and y==z, 
            (1, 1, 2):lambda x,y,z: x==y and y<z,
            (1, 2, 1):lambda x,y,z: x<y and x==z,  
            (1, 2, 2):lambda x,y,z: x<y and y==z,
            (1, 2, 3):lambda x,y,z: x<y and y<z, 
            (2, 1, 1):lambda x,y,z: y<x and y==z, 
            (2, 1, 2):lambda x,y,z: x>y and x==z,
            (2, 1, 3):lambda x,y,z: x>y and z>x,
            (2, 2, 1):lambda x,y,z: x==y and x>z,
            (2, 3, 1):lambda x,y,z: x<y and z<x, 
            (3, 1, 2):lambda x,y,z: x>y and x>z and z>y,
            (3, 2, 1):lambda x,y,z: x>y and y>z
    }

    inp = sys.stdin

    num = int(inp.readline())
    seq = list(map(lambda i: int(i), inp.readline().split(' ')))
    
    hash_seq = sort_and_save_index(seq)
    hash_seq.sort()
    # print(hash_seq)
    out = []
    for key, pattern in patterns.items():
        if find_pattern(pattern, hash_seq):
            out.append(key)
    out.sort()
    for i in out:
        print("{}{}{}".format(i[0], i[1], i[2]))    
solve()