/*
#include <iostream>
#include <string>
#include<sstream>
#include <cmath>
#include <map>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char s[100];
int n;
int main()
{
while(scanf("%s",s),strcmp(s,"#"))
{
n=strlen(s);
if(next_permutation(s,s+n))
printf("%s\n",s);
else
printf("No Successor\n");
}
return 0;
}
*/
#include <iostream>
#include <string>
#include<sstream>
#include <cmath>
#include <map>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
char s[];
int n;
void change(int l,int r)
{
while(l<r)
{
swap(s[l],s[r]);
l++;
r--;
}
}
bool permutation()
{
int i=n-;
while(i>&&s[i-]>=s[i]) i--;
if(!i) return false;
int k=i,j=n-;
for(;j>i;j--)
if(s[j]>s[i-]){
k=j;
break;
}
swap(s[i-],s[k]);
change(i,n-);
return true;
}
int main()
{
while(scanf("%s",s),strcmp(s,"#"))
{
n=strlen(s);
if(permutation())
printf("%s\n",s);
else
printf("No Successor\n");
}
return ;
}