Problem:
 Score : 100 points    Problem Statement Given is a lowercase English letter C that is not z . Print the letter that follows C in alphabetical order.      Constraints  C is a lowercase English letter that is not z .         Input Input is given from Standard Input in the following format:  C       Output Print the letter that follows C in alphabetical order.        Sample Input 1 a      Sample Output 1 b  a is followed by b .       Sample Input 2 y      Sample Output 2 z  y is followed by z .

Solution (Python):
A = str(input())
if A == "a":
	print("b")
elif A == "b":
	print("c")
elif A == "c":
	print("d")
elif A == "d":
	print("e")
elif A == "e":
	print("f")
elif A == "f":
	print("g")
elif A == "g":
	print("h")
elif A == "h":
	print("i")
elif A == "i":
	print("j")
elif A == "j":
	print("k")
elif A == "k":
	print("l")
elif A == "l":
	print("m")
elif A == "m":
	print("n")
elif A == "n":
	print("o")
elif A == "o":
	print("p")
elif A == "p":
	print("q")
elif A == "q":
	print("r")
elif A == "r":
	print("s")
elif A == "s":
	print("t")
elif A == "t":
	print("u")
elif A == "u":
	print("v")
elif A == "v":
	print("w")
elif A == "w":
	print("x")
elif A == "x":
	print("y")
elif A == "y":
	print("z")

Solution (Python):
C = input()
print(chr(ord(C) + 1))

Solution (Python):
def main():
    c = input()
    print(chr(ord(c)+1))

    

main()

Solution (Python):
s = input()

print(chr(ord(s) + 1))

Solution (Python):



c = input()
c_num = ord(c) + 1
print(chr(c_num))

Solution (Python):
s = input()
print(chr(ord(s) + 1))

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):
A = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
print(A[A.index(input()) + 1])

Solution (Python):
c = input()

alpa = 'abcdefghijklmnopqrstuvwxyz'

print(alpa[alpa.index(c)+1])

Solution (Python):
C = input()

n = ord(C)

n = n + 1

c = chr(n)

print(c)

Solution (Python):
c = str(input())

print(chr(ord(c) + 1))

Solution (Python):

print(chr(ord(input()) + 1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
a = input()
print(chr(ord(a)+1))

Solution (Python):
a = input()
print(chr(ord(a)+1))

Solution (Python):
a = input()
print(chr(ord(a)+1))

Solution (Python):
c=input()
print(chr(ord(c)+1))

Solution (Python):
c=input()

alphabet=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

for i in range(len(alphabet)):
  if c==alphabet[i]:
    answer=alphabet[i+1]

print(answer)

Solution (Python):
import string
alphabet = string.ascii_lowercase
c = input()
print(alphabet[alphabet.find(c) + 1])

Solution (Python):
C=input()
print(chr(ord(C)+1))

Solution (Python):
C = input()
print(chr(ord(C) + 1))

Solution (Python):
c=input()
print(chr(ord(c)+1))

Solution (Python):
listA = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
C = input()
for i in range(25):
  if C == listA[i]:
    print(listA[i+1])

Solution (Python):
c=input()
print(chr(ord(c)+1))

Solution (Python):
alphabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]
C = input(str())
c = int(alphabet.index(C))
ans = int(c + 1)
print(alphabet[ans])

Solution (Python):
a = 'abcdefghijklmnopqrstuvwxyz'

mo = input()

index = 0
for i in a :
  if mo == i :
    print(a[index+1])
  index += 1

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = input()
d = ord(c)+1
e = chr(d)
print(e)

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
C = input()
ascii = chr(ord(C) + 1)
print(ascii)

Solution (Python):

AA=input()

if AA == "a":
	print("b")
elif AA == "b":
	print("c")
elif AA == "c":
	print("d")
elif AA == "d":
	print("e")
elif AA == "e":
	print("f")
elif AA == "f":
	print("g")
elif AA == "g":
	print("h")
elif AA == "h":
	print("i")
elif AA == "i":
	print("j")
elif AA == "j":
	print("k")
elif AA == "k":
	print("l")
elif AA == "l":
	print("m")
elif AA == "m":
	print("n")
elif AA == "n":
	print("o")
elif AA == "o":
	print("p")
elif AA == "p":
	print("q")
elif AA == "q":
	print("r")
elif AA == "r":
	print("s")
elif AA == "s":
	print("t")
elif AA == "t":
	print("u")
elif AA == "u":
	print("v")
elif AA == "v":
	print("w")
elif AA == "w":
	print("x")
elif AA == "x":
	print("y")
elif AA == "y":
	print("z")
else:
	print("a")

Solution (Python):
c = input()
next_alphabet = chr(ord(c) + 1)
print(next_alphabet)

Solution (Python):
alp = "abcdefghijklmnopqrstuvwxyz"
s = input()
for i in range(len(alp)):
  if alp[i] == s:
    print(alp[i+1])
    break

Solution (Python):
s = input()
print(chr(ord(s) + 1))

Solution (Python):
l = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u"
     , "v", "w", "x", "y", "z"]

s = input()
print(l[l.index(s) + 1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
C=input()
words=[chr(i) for i in range(97, 97+26)]
a=words.index(C)
print(words[a+1])

Solution (Python):
s = input()

print(chr(ord(s) + 1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
C = input()
eng = [chr(ord('a') + i) for i in range(26)]
for i in eng:
    if C < i:
        print(i)
        exit()

Solution (Python):
c = input()
c = ord(c) + 1
c = chr(c)
print(c)

Solution (Python):
from string import ascii_lowercase

C = input()

print(ascii_lowercase[ascii_lowercase.index(C) + 1])

Solution (Python):
c = input()
li = list("abcdefghijklmnopqrstuvwxyz")
i = li.index(c)
print(li[i+1])

Solution (Python):
c=input()
if c=="z":
    print("a")
else:
    print(chr(ord(c)+1))

Solution (Python):
S=input()
num=ord(S)
print(chr(num+1))

Solution (Python):
s = input()
print(chr(ord(s) + 1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
moji = ord(input())

moji += 1

print(chr(moji))

Solution (Python):
a=ord(input())
b=a+1
print(chr(b))

Solution (Python):
c =input()
l = 'abcdefghijklmnopqrstuvwxyz'
 
print(l[l.index(c) + 1])

Solution (Python):


print(chr(ord(input())+1))

Solution (Python):
s = input()

print(chr(ord(s) + 1))

Solution (Python):
S = ["a","b","c","d","e","f","g","h","i","j","k","l","n","m","o","p","q","r","s","t","u","v","w","x","y","z"]

qu = S.index(input())

print(S[qu+1])

Solution (Python):

c = str(input())
print(chr(ord(c)+1))

Solution (Python):
s = input()
print(chr(ord(s) + 1))

Solution (Python):
C = input()
num = ord(C)
out = chr( num + 1)

print(out)

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):


lst = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
        'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
C = input()


if C == 'z':
    print('a')
else:
    print(lst[lst.index(C) + 1])

Solution (Python):
abc = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]
abcd = "abcdefghijklmnopqrstuvwxyz"

x = input()
index = abcd.find(x)

print(abc[index+1])

Solution (Python):
C=input()
string="abcdefghijklmnopqrstuvwxyz"
for i in range(0,25):
    if C==string[i]:
        print(string[i+1])

Solution (Python):
aaa = input()

chr_1 = [chr(ord('a') + i) for i in range(26)]

for i in range(26):
    if aaa == chr_1[i]:
        print(chr_1[i+1])

Solution (Python):
C = input()
lst ='abcdefghijklmnopqrstuvwxyz'

j = 0

for m, i in enumerate(lst):
    if i==C:j =m+1
print(lst[j])

Solution (Python):

def main():
    
    c = str(input())
    
    mojiretsu='abcdefghijklmnopqrstuvwxyz'
    
    index = mojiretsu.find(c)

    print(mojiretsu[index+1])


if __name__ == '__main__':
    main()

Solution (Python):
c=input()
s='abcdefghijklmnopqrstuvwxyz'
list=list(s)

n=list.index(c)
print(list[n+1])

Solution (Python):
alph = 'abcdefghijklmnopqrstuvwxyz'
alph_lst = list(alph)
c = input()
print(alph_lst[alph_lst.index(c) + 1])

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
c = input()

print(chr(ord(c) + 1))

Solution (Python):
c = input()
alphas = list('abcdefghijklmnopqrstuvwxyz')
index = alphas.index(c)
print(alphas[index + 1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = input()
c_1 = ord(c) + 1
print(chr(c_1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):









c=input()


print(chr(ord(c) + 1))

Solution (Python):

c = input()
print(chr(ord(c) + 1))

Solution (Python):
s = input()
print(chr(ord(s)+1))

Solution (Python):
c=input()
l=[chr(i) for i in range(97,97+26)]
s=l.index(c)
print(l[s+1])

Solution (Python):
N = str(input())
A = [chr(i) for i in range(97, 97+26)]
S = A.index(N)
print(A[S+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
input = input()
alphabet = [chr(ord('a') + i) for i in range(26)]
print(alphabet[alphabet.index(input) + 1])

Solution (Python):
a = input()
b = ord(a)+1
print(chr(b))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):
from sys import stdin
import math

c = stdin.readline().rstrip()

c = ord(c)
c += 1
c = chr(c)

print(c)

Solution (Python):
n=ord(input())
print(chr(n+1))

Solution (Python):
imp = input()
alp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p',
       'q','r','s','t','u','v','w','x','y','z']
print(alp[alp.index(imp) + 1])

Solution (Python):
print(chr(ord(input()[0])+1))

Solution (Python):
c=input()
print(chr(ord(c)+1))

Solution (Python):
print(chr(ord(str(input())) +1))

Solution (Python):
c = input()
print(chr(ord(c) + 1))

Solution (Python):
car='abcdefghijklmnopqrstuvwxyza'
inp=input()
for i in range(27):
  if car[i]==inp:
    print(car[i+1])
    break

Solution (Python):
C = ord (input() )
A = C + 1
B = chr(A)
print(B)

Solution (Python):
ans = input()
l = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']

for i in range(25):
  if l[i] == ans:
    print(l[i+1])
  else:
    continue

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = chr(ord(input())+1)
print(c)

Solution (Python):
C = input()
print(chr(ord(C)+1))

Solution (Python):
import sys
import fractions
from functools import reduce
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

print(chr(ord(input()) + 1))

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()

C = i_s()

print(chr(ord(C) + 1))

Solution (Python):
c = input()
print(chr((ord(c)-96)%26+97))

Solution (Python):
S = input()
print(chr(ord(S) + 1))

Solution (Python):
S = input()

alp = 'abcdefghijklmnopqrstuvwxyz'
ans = alp[(alp.index(S) + 1)]
print(ans)

Solution (Python):
A=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
B=input()
for i in range(len(A)):
  if B==A[i]:
    print(A[i+1])

Solution (Python):
C = input()
print(chr(ord(C)+1))

Solution (Python):
character=input()


print(chr(ord(character)+1))

Solution (Python):
import string
s = input()
x = string.ascii_letters
for i in range(len(x)):
    if x[i] == s:
        print(x[i+1])
        break

Solution (Python):
C = input()
ordC = ord(C)
print(chr(ordC+1))

Solution (Python):
c = input()

list=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
count=0

for i in list:
  if(count==1):
    print(i)
    break
  if(c==i):
    count=1

Solution (Python):
A = "abcdefghijklmnopqrstuvwxyz"
C = input()
end = False
for ch in A:
    if end:
        A = ch
        break
    if ch == C:
        end = True
print(A)

Solution (Python):
a = str(input())
print(chr(ord(a) + 1))

Solution (Python):
def solve():
    N = input()
    return chr(ord(N)+1)

print(solve())

Solution (Python):
from collections import defaultdict

def solve():
    N = input()
    d = defaultdict(str)
    d['a'] = 'b'
    d['b'] = 'c'
    d['c'] = 'd'
    d['d'] = 'e'
    d['e'] = 'f'
    d['f'] = 'g'
    d['g'] = 'h'
    d['h'] = 'i'
    d['i'] = 'j'
    d['j'] = 'k'
    d['k'] = 'l'
    d['l'] = 'm'
    d['m'] = 'n'
    d['n'] = 'o'
    d['o'] = 'p'
    d['p'] = 'q'
    d['q'] = 'r'
    d['r'] = 's'
    d['s'] = 't'
    d['t'] = 'u'
    d['u'] = 'v'
    d['v'] = 'w'
    d['w'] = 'x'
    d['x'] = 'y'
    d['y'] = 'z'
    return d[N]

print(solve())

Solution (Python):
k=input()
k=ord(k)+1
k=chr(k)
print(k)

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = input()

print (chr(ord(c) + 1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
s = input()
ans = chr(ord(s)+1)
print(ans)

Solution (Python):
Z = input()
print(chr(ord(Z) + 1))

Solution (Python):
C = input()
print(chr(ord(C)+1))

Solution (Python):
t="abcdefghijklmnopqrstuvwxyz"
print(t[t.index(input())+1])

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
s = input()
print(chr(ord(s) + 1))

Solution (Python):

c=input()
c1=ord(c)
print(chr(c1+1))

Solution (Python):
C = input()

s = [chr(i) for i in range(97, 97+26)]

for i in range(26):
  if s[i]==C:
    print(s[i+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
C=input()

print(chr(ord(C)+1))

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    c = input().strip()
    print(chr(ord(c) + 1))


if __name__ == "__main__":
    main()

Solution (Python):
C = str(input())
alf = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(alf)):
  if C == alf[i]:
    print(alf[i+1])
    break

Solution (Python):
a = input()

aa = ord(a)

aa += 1
print(chr(aa))

Solution (Python):
a = input()

alpha = "a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z"
alpha = alpha.split(",")
index = alpha.index(a)

print(alpha[index+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = str(input())

print(chr(ord(c) + 1))

Solution (Python):
C = str(input())

if C == "a":
    print("b")
if C == "b":
    print("c")
if C == "c":
    print("d")
if C == "d":
    print("e")
if C == "e":
    print("f")
if C == "f":
    print("g")
if C == "g":
    print("h")
if C == "h":
    print("i")
if C == "i":
    print("j")
if C == "j":
    print("k")
if C == "k":
    print("l")
if C == "l":
    print("m")
if C == "m":
    print("n")
if C == "n":
    print("o")
if C == "o":
    print("p")
if C == "p":
    print("q")
if C == "q":
    print("r")
if C == "r":
    print("s")
if C == "s":
    print("t")
if C == "t":
    print("u")
if C == "u":
    print("v")
if C == "v":
    print("w")
if C == "w":
    print("x")
if C == "x":
    print("y")
if C == "y":
    print("z")

Solution (Python):
s = input()

print(chr(ord(s)+1))

Solution (Python):
from string import ascii_lowercase
C = input()
print(ascii_lowercase[ascii_lowercase.index(C) + 1])

Solution (Python):
N = input()

print(chr(ord(N) + 1))

Solution (Python):
c=input()
r="abcdefghijklmnopqrstuvwxyz".find(c)
d="abcdefghijklmnopqrstuvwxyz"
print(d[r+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
list = [chr(i) for i in range(97,97+26)]
input = input()
print(list[list.index(input)+1])

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
C = input()

ans = chr(ord(C) + 1)

print(ans)

Solution (Python):
print(chr(ord(str(input()))+1))

Solution (Python):
c=input()
print( chr(ord(c) + 1) )

Solution (Python):

c = input()
ls = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
print(ls[ls.index(c)+1])

Solution (Python):
s = input()
t = chr(ord(s)+1)
print(t)

Solution (Python):
C = input()
D = chr(ord(C)+1)
print(D)

Solution (Python):

c=input()
s=ord(c)
s+=1
print(chr(s))

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):
C = input()
print(chr(ord(C) + 1))

Solution (Python):
al = list("abcdefghijklmnopqistuvwxyz")

c = input()

print(al[al.index(c)+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = input()
al = "abcdefghijklmnopqrstuvwxyz"
print(al[al.index(c) + 1])

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
c=input()
print(chr(ord(c)+1))

Solution (Python):
S=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
C=input()
for i in range(25):
    if S[i]==C:
        K=i+1
        break
    
if S[25]==C:
    K=0

print(S[K])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
C = input()
lis = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',
       'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
for x in range(len(lis)):
  if C == lis[x]:
    print(lis[x+1])
    break

Solution (Python):
arg = input()
alphabets = 'abcdefghijklmnopqrstuvwxyz'
pos = alphabets.find(arg)

if pos != -1:
    answer = alphabets[pos + 1]
    print(answer)

Solution (Python):


C= input()

if C=="z":
    print("a")
else:
    print(chr(ord(C) + 1))

Solution (Python):
A = "abcdefghijklmnopqrstuvwxyz"
n = input()
print(A[A.index(n)+1])

Solution (Python):
a = ["a","b","c","d","e","f","g",
    "h","i","j","k","l","m","n",
    "o","p","q","r","s","t","u",
    "v","w","x","y","z"]
C = input()
print(a[(a.index(C)+1)%26])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
s=input()
print(chr(ord(s)+1))

Solution (Python):
a = input()
a = ord(a) + 1
print(chr(a))

Solution (Python):
import sys
alp = "abcdefghijklmnopqrstuvwxyza"
C = input()
for i in range(26):
    if alp[i] == C:
        print(alp[i+1])
        sys.exit()

Solution (Python):
c=input()
print(chr(ord(c)+1))

Solution (Python):
A = input()
print(chr(ord(A)+1))

Solution (Python):
import string
S=list(string.ascii_lowercase)
C=input()
print(S[S.index(C)+1])

Solution (Python):
import string
S=list(string.ascii_lowercase)
C=input()
for i in range(len(S)):
    if S[i]==C:
        ans=i+1

print(S[ans])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
C = input()
al = list("abcdefghijklmnopqrstuvwxyz")
print(al[al.index(C)+1])

Solution (Python):
def main():
    C = input()

    print(chr(ord(C)+1))

if __name__ == "__main__":
    main()

Solution (Python):
a = [chr(i) for i in range(97, 97 + 26)]

c = input().rstrip()

cIndex = a.index(c)

print(a[cIndex + 1])

Solution (Python):
C = input()
alpha = list("abcdefghijklmnopqrstuvwxyz")
print(alpha[alpha.index(C)+1])

Solution (Python):
C = input()
A = "abcdefghijklmnopqrstuvwxyz"
print(A[A.index(C) + 1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
A=input()
print (chr(ord(A)+1))

Solution (Python):
C=input()
A=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(len(A)):
    if C==A[i]:
        print (A[i+1])

Solution (Python):
C = input()
print(chr(ord(C)+1))

Solution (Python):
list1 = [chr(i) for i in range(97, 97+26)]
i = input()
print(list1[list1.index(i)+1])

Solution (Python):
c = input()

print(chr(ord(c)+1))

Solution (Python):
C = input()

print(chr(ord(C)+1))

Solution (Python):
C = input()
print(chr(ord(C)+1))

Solution (Python):
c = input()
alpha2num = lambda c: ord(c) - ord("A") + 1
numc = alpha2num(c)+1

num2alpha = lambda c: chr(c+64)
alpc = num2alpha(numc)
print(alpc)

Solution (Python):
c = input()
wk= list("abcdefghijklmnopqrstuvwxyz")
ans = wk[wk.index(c)+1]
print(ans)

Solution (Python):
c = input()
wk= "abcdefghijklmnopqrstuvwxyz"

for i in range(26):
    if wk[i] == c:
        print(wk[i+1])
        break

Solution (Python):
c = input()
print(chr(ord(c) + 1))

Solution (Python):
input1 = input()
Alphabets = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
index = 0
for Alphabet in Alphabets:
  if Alphabet == input1:
    print(Alphabets[index + 1])
    break
  else:
    index += 1

Solution (Python):
a = input()
b = list('abcdefghijklmnopqrstuvwxyz')
 
print(b[b.index(a) + 1])

Solution (Python):
a = input()
b = list('abcdefghijklmnopqrstuvwxyz')

print(b[b.index(a) + 1])

Solution (Python):
a=input()
print(chr(ord(a)+1))

Solution (Python):
l = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
s = input()
for i in range(25):
  if s == l[i]:
    print(l[i+1])

Solution (Python):
C = input()

alp=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
i=0
while True:
    if alp[i]==C:
        print(alp[i+1])
        break
    else:
        i+=1

Solution (Python):
print(chr(ord(str(input())) + 1))

Solution (Python):
c = input()
print(chr(ord(c) + 1))

Solution (Python):
c = input()
print(chr(ord(c) + 1))

Solution (Python):







c = input()

strlist = "abcdefghijklmnopqrstuvwxyz"

idx = strlist.find(c) +1
ans = strlist[idx]

print(ans)

Solution (Python):
a = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
b = input()
for i in range(26):
    if b == a[i]:
        print(a[i+1])

Solution (Python):
a = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
b = input()
for i in range(26):
    if b == a[i]:
        print(a[i+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input().strip())+1))

Solution (Python):
a=input()
print(chr(ord(a)+1))

Solution (Python):
C = input()
num = ord(C)
print(chr(num + 1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
C=input()

ans=ord(C)
print(chr(ans+1))

Solution (Python):
C=input()
print(chr(ord(C)+1))

Solution (Python):
moji = "abcdefghijklmnopqrstuvwxyz"
a = input()
index = moji.find(a)
print(moji[index + 1])

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):
C=input()
ord_C=ord(C)
ord_D=ord_C+1
print (chr(ord_D))

Solution (Python):

print(chr(ord(input())+1))

Solution (Python):
a = input()
a_ascii = ord(a)
a_ascii+=1
print(chr(a_ascii))

Solution (Python):
def main():
    c = ord(input())
    c += 1
    if c == 123:
        c = 97
    print(chr(c))

if __name__ == '__main__':
    main()

Solution (Python):
c = input()

alp = [chr(i) for i in range(97, 97+26)]

print(alp[alp.index(c)+1])

Solution (Python):
c = input()
ans = chr(ord(c) + 1)

print(ans)

Solution (Python):
C = input()

print(chr(ord(C) + 1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
l = 'abcdefghijklmnopqrstuvwxyz'
n = str(input())
c = l.find(n)
print(l[c+1])

Solution (Python):
list = ['a' ,'b', 'c', 'd', 'e', 'f' , 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 's', 't', 'u', 'v', 'w', 'x', 'y','z']
n = input()
i = 0
while n != list[i]:
  i += 1
i += 1
print(list[i])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input()) + 1))

Solution (Python):


import sys


def solve(C: str):
    L = [chr(ord('a') + i) for i in range(26)]
    
    print(L[L.index(C)+1])


    



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    C = next(tokens)  
    solve(C)

if __name__ == '__main__':
    main()

Solution (Python):
C=input()
c=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for i in range(30):
    if C==c[i]:
        ans=c[i+1]
        break
print(ans)

Solution (Python):
C=input()
Dictionary=list("abcdefghijklmnopqrstuvwxyz")
X=Dictionary.index(C)
print(Dictionary[X+1])

Solution (Python):
s=input()
print(chr(ord(s)+1)) if s!="z" else print("a")

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):
c = input()
print(chr(ord(c) + 1))

Solution (Python):
c = input()

alphabet = "abcdefghijklmnopqrstuvwxyz"

for i, a in enumerate(alphabet):
    if a == c:
        print(alphabet[i+1])
        break

Solution (Python):
c = input()

alphabet = "abcdefghijklmnopqrstuvwxyz"

for i, a in enumerate(alphabet):
    if a == c:
        print(alphabet[i+1])
        break

Solution (Python):
l = list("abcdefghijklmnopqrstuvwxyz")
a = input()
print(l[l.index(a)+1])

Solution (Python):
c = input()
print(chr((ord(c)+1)))

Solution (Python):
s=input()
print(chr(ord(s[0])+1))

Solution (Python):
alphaList = "abcdefghijklmnopqrstuvwxyz"
print(alphaList[alphaList.index(input())+1])

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    c = str(readline().rstrip().decode('utf-8'))
    print(chr(ord(c) + 1))


if __name__ == '__main__':
    solve()

Solution (Python):
N = input()
A_Z = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(A_Z)):
    if A_Z[i] == N:
        print(A_Z[i+1])
        break

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c=ord(input())
print(chr(c+1))

Solution (Python):
ch = input()
print(chr(ord(ch)+1))

Solution (Python):
c = input()
n = ord(c)
ans = chr(n + 1)
print(ans)

Solution (Python):
A=ord(input())
print(chr(A+1))

Solution (Python):
alpha=list("abcdefghijklmnopqrstuvwxyz")
bet=input()
print(alpha[int(alpha.index(bet)+1)])

Solution (Python):
C = str(input())
print(chr(ord(C)+1))

Solution (Python):
C = input()
list = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
print(list[list.index(C)+1])

Solution (Python):
s = input()
print(chr(ord(s)+1))

Solution (Python):
c = ord(input())
print(chr(c+1))

Solution (Python):
C =input()
alp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(len(alp)):
    if alp[i] == C:
        print(alp[i+1])
        exit()

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    c = lines[0]

    return (c, )


def solve(c):
    
    chars = 'abcdefghijklmnopqrstuvwxyz'
    idx = chars.index(c)
    result = chars[idx+1]
        
    return result
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Solution (Python):
S=ord(input())
print(chr(S+1))

Solution (Python):


from collections import defaultdict

a = ord(input())

ans = chr(a + 1)

print(ans)

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]


def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

c = input()
print(chr(ord(c)+1))

Solution (Python):
C=input()
print (chr(ord(C)+1))

Solution (Python):
a = "abcdefghijklmnopqrstuvwxyz"
b = input()
c = a.index(b) + 1
print(a[c])

Solution (Python):
c = ord(input())
print(chr(c+1))

Solution (Python):
z=input()

A=chr(ord(z)+1)

print(A)

Solution (Python):
arr=list('abcdefghijklmnopqrstuvwxyz')
C=input()
for i in range(len(arr)):
  if arr[i] == C:
    print(arr[i+1])

Solution (Python):
C = input()

tmp = ord(C)
print(chr(tmp+1))

Solution (Python):
a = input()

print(chr(ord(a) + 1))

Solution (Python):
alpha = input()
print(chr(ord(alpha)+1))

Solution (Python):
C = input()
print(chr(ord(C)+1))

Solution (Python):
C = input()
print(chr(ord(C)+1))

Solution (Python):
import numpy as np

num = input()
num = ord(num) +1
num = chr(num)
print(num)

Solution (Python):
c = str(input())
print(chr(ord(c) + 1))

Solution (Python):
C = input()

alpha = [chr(ord('a') + i) for i in range(26)]

print(alpha[alpha.index(C)+1])

Solution (Python):
C = input()

print (chr(ord(C) + 1))

Solution (Python):
word = input()
number = int(ord(word))
print(chr(number+1))

Solution (Python):
l=input()
x='abcdefghijklmnopqrstuvwxyz'
for k in range(len(x)):
  if x[k]==l:
    print(x[k+1])

Solution (Python):
word=input()
ord_s = ord(word)
ord_s+=1
chr_s=chr(ord_s)
print(chr_s)

Solution (Python):
c = input()
print(chr(ord(c) + 1))

Solution (Python):
c=input()
ans=chr(ord(c)+1)
print(ans)

Solution (Python):
c = input()


print(chr(ord(c) + 1))

Solution (Python):
C = input()
A = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
N = A.index(C)
print(A[N+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c = input()

print(chr(ord(c)+1))

Solution (Python):
n=input()
print(chr(ord(n)+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
C=input()
print(chr(ord(C)+1))

Solution (Python):
C = input()
alphabet = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']

for i in range(len(alphabet)):
  if C == alphabet[i]:
    print(alphabet[i+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
def main():
    C = input()
    print(chr(ord(C) + 1))
    return


main()

Solution (Python):


C=input()
print(chr(ord(C)+ 1))

Solution (Python):
C = input()

alpha = "abcdefghijklmnopqrstuvwxyz"

for i in range(26):
    if C == alpha[i]:
        print(alpha[i+1])

Solution (Python):
i = input()
print(chr(ord(i)+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
from collections import Counter

x=input()
print(chr(ord(x)+1))

Solution (Python):
xx=input()
al=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(len(al)-1):
  if xx==al[i]:
    print(al[i+1])

Solution (Python):
c = input()
C = ord(c)
print(chr(C+1))

Solution (Python):
alp='abcdefghijklmnopqrstuvwxyz'
s=str(input())
flag=False
for c in alp:
  if flag:
    print(c)
    break
  if c==s:
    flag=True

Solution (Python):
C = input()

print(chr(ord(C) + 1))

Solution (Python):
alp = 'abcdefghijklmnopqrstuvwxyz'

s = str(input())

flag = False
for c in alp:
    if flag:
        print(c)
        break
    if c == s:
        flag = True

Solution (Python):
s="abcdefghijklmnopqrstuvwxyz"
print(s[s.index(input())+1])

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
print(chr(ord(input())+1))

Solution (Python):
c=input()
axc_c=ord(c)
print(chr(axc_c+1))

Solution (Python):
c = input()
c = chr(ord(c) + 1)
print(c)

Solution (Python):
n = input()

print(chr(ord(n)+1))

Solution (Python):
class Solution:
    def solve(self, C: str) -> str:
        return chr(ord(C)+1)


if __name__ == '__main__':

    
    C = input()

    
    solution = Solution()
    print(solution.solve(C))

Solution (Python):
c = input()
print(chr(ord(c)+1))

Solution (Python):
s = input()
print(chr(ord(s)+1))

Solution (Python):
c = input()
print(chr(ord(c)+1))