#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<string>

using namespace std;

const int maxn=1000100;
const int INF=(1<<28);

int a[maxn],n;
char s[maxn];

int main()
{
    while(scanf("%s",s)!=EOF){
        memset(a,0,sizeof(a));
        n=0;
        //s[strlen(s)]=‘5‘;
       // s[strlen(s)+1]=‘\0‘;
        for(int i=0;i<strlen(s);i++){
            if(s[i]!=‘5‘){
                a[n]=a[n]*10+s[i]-‘0‘;
            }
            else if(i!=0){
                if(s[i-1]!=‘5‘) n++;
            }
        }
        if(s[strlen(s)-1]!=‘5‘) n++;
        sort(a,a+n);
        for(int i=0;i<n;i++){
            cout<<a[i];
            if(i!=n-1) cout<<" ";
        }
        cout<<endl;
    }
    return 0;
}