#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int isLetter(char c) {
    int ci = (int)c;
    return (ci >= 49 && ci <= 57) || (ci>=65 && ci <=90) || (ci >= 97 && ci <=122);
}
int close (int c,  char *key) {
    switch(c) {
        case 100:
            fprintf(stderr, "Error: Chybny vstup!\n");
            free(key);
            return 100;
        case 0:
            free(key);
            return 0;
    }
    return c;
}

void swap (char* a, char* b)
{
    char t = *a;*a = *b;*b = t;
}
int compare (const void *a, const void *b)
{  return ( *(char *)a - *(char *)b ); }
void Permut( char *key, int index )
{
    qsort( key, index, sizeof( key[8] ), compare ); //Sort ASII
    for (;;){

        printf("%s", key);
        int i  = index - 2  ;
        while (i>=0) {
           if (key[i] < key[i+1])
              break;
          --i;}
        if ( i == -1 )
            break;
        else
        {
            int l=i+1;
            int h = index -1;
            int ceilIndex = l;
            for (int j = l+1; j <= h; j++){
            if (key[j] > key[i] && key[j] < key[ceilIndex])
                ceilIndex = j;
            break;
        }

            swap( key + i, key +ceilIndex );

            qsort( key + i + 1, index - i - 1, sizeof(key[8]), compare ); //Sort

        }
    }
}
int main(int argc, char *argv[])
{
    int Maxsize=8;
    int index=0;
    char *key = malloc(sizeof(char)*Maxsize);
    for (;;) {
        scanf("%c", key+index);
        if (key[0] == '\n')
            {
                return close(100,key);
            }
        if (key[index] == '\n'){
            break;
        }
        if (!isLetter(key[index])){

            return close(100, key);
        }
        index++;
    }
Permut( key, index);
return close(0, key);
}