518A - Vitaly and Strings【string】

A. Vitaly and Strings

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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, strings is lexicographically smaller than stringt. Vitaly wondered if there is such string that is lexicographically larger than strings and at the same is lexicographically smaller than stringt. This string should also consist of lowercase English letters and have the length equal to the lengths of stringss 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 andt 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 test(s)

Input

ac

Output

b

Input

aaazzz

Output

kkk

Input

abcdefgabcdefh

Output

No such string

Note

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

小的字符串加一，如果小于等于大的字符串，输出这个字符串

int main(){    string a,b;    cin>>a>>b;    for(int i=a.length()-1;i>=0;i--)    {        if(a[i]=='z')a[i]='a';        else        {           a[i]++;           break;        }    }    a<b?cout<<a<<endl:cout<<"No Such String"<<endl;    return 0;}