template<class BidirectionalIterator>

bool next_permutation(

      BidirectionalIterator _First,

      BidirectionalIterator _Last

);

template<class BidirectionalIterator, class BinaryPredicate>

bool next_permutation(

      BidirectionalIterator _First,

      BidirectionalIterator _Last,

      BinaryPredicate _Comp

 );

#include <iostream>

#include <algorithm>

#include <string>

using namespace std;

string line;

bool comp(char a, char b){

    return a>b;

}

int main(){

    while(cin>>line){

        if(line.at() == '#')

            break;

        string s(line);

        sort(s.begin(),s.end(),comp);

        if(line == s){

            cout<<"No Successor"<<endl;

            continue;

        }

        next_permutation(line.begin(),line.end());

        cout<<line<<endl;

    }

    return ;

}