//孤独数字
import java.util.Scanner;
import java.util.Arrays;
public class Main{
static int N=105;
static int a[] =new int[N];
static int st[]=new int[N];
static int n;
public static void main(String[] args){
Scanner in=new Scanner(System.in);
n=in.nextInt();
Arrays.fill(st,0);//清空数组
for(int i=1;i<=n;i++){
a[i]=in.nextInt();
st[a[i]]++;}
for(int i=0;i<=N-1;i++){
if(int i=0;i<=N-1;i++)
System.out.println(a[i]);}
}
}