def qiuHe(n):
   s = 0
   while n != 0:
      s = s + n % 10;
      n = n // 10;
   return s;

n=int(input())
l1=list(map(int,input().split()))
l2=[]
# for l in l1:
   # //l2.append(qiuHe(l));
for i in range(0,len(l1)):
   l1[i] = qiuHe(l1[i]);
l1.sort();

for x in l1:
   print(x,end=' ')


/**************************************************************
	Problem: 1166
	User: admin
	Language: Python
	Result: Accepted
	Time:89 ms
	Memory:34480 kb
****************************************************************/