#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int cmp(const void *a,const void *b){return *(char *)a-*(char *)b;}int main(){char s[60];int i,j,sign,len;while(1){gets(s);sign=0;len=strlen(s);if(len==1 && s[0]=='#')break;for(i=len-1; i>=1; i--)if(s[i-1]<s[i]){sign=1;break;}if(sign==0)printf("No Successorn");else{ char ma=120;int k;for(j=i; j<len; j++)if(s[j]<ma && s[j]>s[i-1]){ma=s[j];k=j;}char m=s[i-1];s[i-1]=s[k];s[k]=m;qsort(&s[i],len-i,sizeof(char),cmp);for(j=0; j<len; j++)printf("%c",s[j]); printf("n");}}return 0;}
