Vitaly and Strings



G - Vitaly and Strings

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

Vitaly is a diligent student who never missed a lesson in his five years of studying in the university. He always does his homework on time and passes his exams in time.

During the last lesson the teacher has provided two strings s and t to Vitaly. The strings have the same length, they consist of lowercase English letters, string s is lexicographically smaller than string t. Vitaly wondered if there is such string that is lexicographically larger than string s and at the same is lexicographically smaller than string t. This string should also consist of lowercase English letters and have the length equal to the lengths of strings s and t.

Let's help Vitaly solve this easy problem!

Input

The first line contains string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters. Here, |s| denotes the length of the string.

The second line contains string t (|t| = |s|), consisting of lowercase English letters.

It is guaranteed that the lengths of strings s and t are the same and string s is lexicographically less than string t.

Output

If the string that meets the given requirements doesn't exist, print a single string "No such string" (without the quotes).

If such string exists, print it. If there are multiple valid strings, you may print any of them.

Sample Input

Input

a
c

Output

b

Input

aaa
zzz

Output

kkk

Input

abcdefg
abcdefh

Output

No such string

Sample Output

     
     

      
       37 
     
     

 

Hint

String s = s₁s₂... s_n is said to be lexicographically smaller than t = t₁t₂... t_n, if there exists such i, that s₁ = t₁, s₂ = t₂, ... s_i - 1 = t_i - 1, s_i < t_i.

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
string s1,s2;
int main() {
    //freopen("D://imput.txt","r",stdin);
    cin>>s1>>s2;
    s1[s1.length()-1]++;
    for(int i=s1.length()-1; i>=0; i--)
        if(s1[i]>'z') {
            s1[i-1]++;

	    s1[i]--;
        }
    if(s1==s2)cout<<"No such string";
    else  cout<<s1;
    return 0;

}