For this Question: Given a string S of length N. Find a string R of length N such that hamming distance between S and R is 1 and R is lexicographically smallest possible.
Note: The Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different.Input contains a single string S containing english lowercase alphabets.

Constraints:
1 <= |S| <= 100000Print a single string R, such that R contains english lowercase letters only.Sample Input
aba

Sample Output
aaa

Explanation: hamming distance between aba and aaa = 1 and aaa is lexicographically smallest such string.

Sample Input
a

Sample Output
b, I have written this Solution Code: s = input()
ans = ""
f = 0
for i in range(len(s)):
	if(s[i] != "a" and f == 0):
		ans += "a"
		f = 1
		continue
	ans += s[i]
if(f == 0):
	ans = ans[:len(ans)-1]+"b"
print(ans), In this Programming Language: Python, Now tell me if this Code is compilable or not?