#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX 222222
int N,A[MX];
int nrm(int a,int b,int c){
    int B[3]={a,b,c},L;
    sort(B,B+3),L=unique(B,B+3)-B;
    unordered_map<int,int> T;
    F(L)T[B[i]]=i+1;
    return 100*T[a]+10*T[b]+T[c];
}
set<int> T;
int main(void){
    scanf("%d",&N),ga(N,A);
    F(N)FT(i+1,N)FOR(j,k+1,N)T.insert(nrm(A[i],A[k],A[j]));
    for(auto&h:T)printf("%d\n",h);
    return 0;
}