#include <stdio.h>
int val[1001];
void bubble_sort(int a[],int n)
{
int exchange,temp;
int i,j;
for(i=0;i<n-1;i++){
exchange=0;
for(j =0;j < n-1-i;j++){
if(a[j]>a[j+1])
{
temp=a[j+1];a[j+1]=a[j];a[j]=temp;
exchange=1;
}
}
if(exchange==0)
return;
}
}
void choose_sort(int a[],int n){
int i,j,tmp;
for(i=0;i<n;i++){
tmp=a[i];
for(j = i + 1;j < n;j++)
if(tmp>a[j])
{tmp=a[i+1];a[i+1]=a[i];a[i]=tmp;}
}
}
int main()
{
int tmp;
int cnt = 0;
int i,j;
while(scanf("%d",&val[cnt]) && val[cnt] != 0) cnt++;
for(i = 0;i < cnt;i++)
{
tmp = val[i];
val[i] = 0;
while(tmp != 0)
{
val[i] += tmp % 10;
tmp /= 10;
}
}
bubble_sort(val,cnt);
printf("i=%d,cnt=%d\n",i,cnt);
printf("%d",val[0]);
for(j = 1;j < cnt;j++) printf(" %d",val[j]);
return 0;
}