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):
alpha = input()
print(chr(ord(alpha)+1))

Solution (Python):

def main():
    C = input().rstrip()
    ans = chr(ord(C) + 1)
    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
c = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'
c_index = alphabet.find(c)
print(alphabet[c_index + 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):
print(chr(ord(input())+1))

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

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

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

Solution (Python):
alphabets = "abcdefghijklmnopqrstuvwxyz"
this_alpha = input()
this_alpha_num = alphabets.find(this_alpha)
print(alphabets[this_alpha_num + 1])

Solution (Python):
c = input()

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

Solution (Python):
alphabets = "abcdefghijklmnopqrstuvwxyz"

c = input()

for i in range(len(alphabets)):
	if c == alphabets[i]:
		print(alphabets[i+1])
		exit()

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

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

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
  
c=input()
d=ord(c)

print(chr(d+1))

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

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

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

Solution (Python):
alpha = input()

alpha_code = ord(alpha)
next_alpha_code = alpha_code + 1
next_alpha = chr(next_alpha_code)
print(next_alpha)

Solution (Python):
target = input('')
ans = 'z'
pro = 1
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']

for i in range(len(list)):
    if (list[i]==target):
        ans = list[i+1]
        pro += 1

print(ans)

Solution (Python):
C=input()
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"]
print(lst[lst.index(C)+1])

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

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

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

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

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

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

Solution (Python):




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

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

for i in range(26):
    if l[i]== x:
        k = i
        
print(l[k+1])

Solution (Python):
alp = "abcdefghijklmnopqrstuvwxyz"
C = input()
n = 0
while alp[n] != C:
    n += 1
print(alp[n+1])

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

Solution (Python):
C = str(input())
alphabet=list('abcdefghijklmnopqrstuvwxyz')

index = alphabet.index(C)
if index==25:
    index=-1
print(alphabet[index+1])

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

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

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

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

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

Solution (Python):
import string
C = input()
tmp = string.printable
for _ in range(10, 36):
    if tmp[_] == C: print(tmp[_+1])

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

Solution (Python):





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

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

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

Solution (Python):
C = input()

al = "abcdefghijklmnopqrstuvwxyz"
i = al.find(C)

print(al[i+1])

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

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

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

Solution (Python):
a = input()

aa = ord(a)

aa += 1
print(chr(aa))

Solution (Python):
C = input()

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

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

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

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

alph = "abcdefghijklmnopqrstuvwxyz"

alphabet_list = list(alph)

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

Solution (Python):
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']

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

Solution (Python):
S = input()
alph = 'abcdefghijklmnopqrstuvwxyz'
for i in range(len(alph)):
    if alph[i] == S:
        print(alph[i + 1])
        break

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

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

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

Solution (Python):


alpha = lambda c: ord(c) - ord("a") + 1
num = lambda c: chr(c + 97)
ans = num(alpha(input()))
print(ans)

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

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

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

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

Solution (Python):
a = ord(input())
a = int(a) + 1

print(chr(a))

Solution (Python):
s = input()
a = 'abcdefghijklmnopqrstuvwxyz'
ans = 0
for i in range(len(a)-1):
  if a[i]==s:
    ans=i+1
    break
print(a[ans])

Solution (Python):
s=input()

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

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

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

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

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

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

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

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

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

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

Solution (Python):
small_alpha = str(input())
alpha_list = [chr(ord('a') + i) for i in range(26)]
for num, alpha in enumerate(alpha_list):
    if alpha == small_alpha:
        print(alpha_list[num + 1])

Solution (Python):
c=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']
print(l[l.index(c)+1])

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

Solution (Python):
s=raw_input()
d=["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(d[d.index(s)+1])

Solution (Python):
import string
c = input()
for i in range(len(string.ascii_lowercase)):
    if c == string.ascii_lowercase[i]:
        print(string.ascii_lowercase[i + 1])

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

Solution (Python):
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"]
place = alpha.index(input(""))
print(alpha[place+1])

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

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

Solution (Python):
if __name__ == '__main__':
    print(chr(ord(input()) + 1))

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

Solution (Python):

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

Solution (Python):
import collections as c
ip = lambda : map(int, input().split())
mod = 10**9+7

c = input()
l = 'abcdefghijklmnopqrstuvwxyz'
ix = l.index(c)
print(l[ix+1])

Solution (Python):

i = input()
res = int(ord(i))
print (chr(res+1))

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

Solution (Python):
import string
a = string.ascii_lowercase

x = input()
print(a[a.index(x)+1])

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

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

def main():
    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']

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

if __name__ == "__main__":
    main()

Solution (Python):
C = input()
l = "abcdefghijklmnopqrstuvwxyz"
print(l[l.index(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):
n=input()
n=chr(ord(n)+1)
print(n)

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

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

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

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

Solution (Python):
S = input()

print(chr(ord(S)+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):
def main():
    C = input()
    print(chr(ord(C) + 1))
    
if __name__ == '__main__':
    main()

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

Solution (Python):
import string
s = input()

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

print(alphabet[alphabet.index(s)+1])

Solution (Python):
a=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[1+list.index(a)])

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

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

Solution (Python):
list_abc = list('abcdefghijklmnopqrstuvwxyz')
N = input()
num = list_abc.index(N)
print(list_abc[num+1])

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

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

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

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

Solution (Python):
l = input()

print(chr(ord(l)+1))

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

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

Solution (Python):
N=input()
alp='abcdefghijklmnopqrstuvwxyz'
print(alp[alp.find(N)+1])

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


alphabets = "abcdefghijklmnopqrstuvwxyz"

c = input().strip()
i = alphabets.index(c)

answer = alphabets[i + 1]
print(answer)

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

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

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

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

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

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

Solution (Python):
c = input()
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']

for i in range(len(abc)):
    if c == abc[i]:
        print(abc[i+1])

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

Solution (Python):
x = ["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 (0,25):
    if c == x[i]:
        print(x[i+1])

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

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

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

Solution (Python):
strings = "abcdefghijklmnopqrstuvwxyz"
str = input()

for i in range(len(strings)):
    if strings[i] == str:
        print(strings[i+1])

Solution (Python):
c = input()

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

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

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

Solution (Python):
str = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'

num = alphabet.find(str)

print(alphabet[num+1])

Solution (Python):
s = 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']
b = a.index(s)
b += 1
print(a[int(b)])

Solution (Python):
s = 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']
b = a.index(s)
b += 1
print(a[int(b)])

Solution (Python):
s = 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']
b = a.index(s)
b += 1
print(a[int(b)])

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

print(alph_list["".join(alph_list).find(C)+1])

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

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

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

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

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

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

Solution (Python):
C=input()

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

Solution (Python):
C=input()
alplist=["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(alplist[alplist.index(C)+1])

Solution (Python):
c = input()
abc = 'abcdefghijklmnopqrstuvwxyz'
for i in range(26) :
    if abc[i] == c :
        print(abc[i+1])
        break

Solution (Python):




def main():
  cs = 'abcdefghijklmnopqrstuvwxyz'
  c = input().strip()
  i = cs.index(c)

  print(cs[i + 1])


if __name__ == '__main__':
  main()

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

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

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

Solution (Python):
C = str(input())
alphabet = [chr(ord('a') + i) for i in range(26)]
for i, alph in enumerate(alphabet):
  if C == alph:
    ans = alphabet[i+1]
    break
print(ans)

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

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

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

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

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

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

Solution (Python):
PLAIN = input()

KEY = 1

enc = ""

for char in list(PLAIN):
    ASCII = ord(char)
    num = ASCII - 97
    num = (num + KEY) % 26
    ASCII = num + 97
    enc += chr(ASCII)

print(enc)

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    c = S()

    return chr(ord(c) + 1)


print(main())

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

Solution (Python):
c = input()

alphabet ='abcdefghijklmnopqrstuvwxyz'

i = alphabet.index(c)
print(alphabet[i+1])

Solution (Python):
C = input()
alp = 'abcdefghijklmnopqrstuvwxyz'
alp_list = list(alp)
num = alp_list.index(C)
print(alp_list[num+1])

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

Solution (Python):
s='abcdefghijklmnopqrstuvwxyz'
print(s[s.index(input())+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',]
C = input()
print(l[l.index(C)+1])

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

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

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

Solution (Python):
c = input()

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

Solution (Python):

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

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']
print(alphabet[alphabet.index(c)+1])

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

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

Solution (Python):
str = input()
char_list = list(str)

asc_char = ord(char_list[0])

print (chr(asc_char+1))

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

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

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

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

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

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

Solution (Python):
from string import ascii_lowercase as alphabets

input = input()
print(alphabets[alphabets.index(input) + 1])

Solution (Python):

C = str(input())

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

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):
str = input().strip()
alphabet_List = [chr(i) for i in range(97, 97+26)]
print(alphabet_List[alphabet_List.index(str) + 1])

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

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

Solution (Python):
s = 'abcdefghijklmnopqrstuvwxyz'

i = s.find(input())
print(s[i+1])

Solution (Python):
import sys

C = input()[0]

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

Solution (Python):
def solve(string):
    return str(chr(ord(string) + 1))


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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

Solution (Python):
C = input()

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

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

Solution (Python):
li = list("abcdefghijklmnopqrstuvwxyz")
c = input()
for i in range(25):
    if c == li[i]:
        print(li[i+1])
        break

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

Solution (Python):
import re

s = input()
S = 'abcdefghijklmnopqrstuvwxyz'

m = re.search(s,S)
print(S[m.start() + 1])

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

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

Solution (Python):
import numpy as np
c = str(input())
base = "".join([chr(i) for i in range(97, 97+26)])
print(base[base.find(c) + 1])

Solution (Python):
C = input()

x = 'abcdefghijklmnopqrstuvwxyz'
print(x[x.index(C) + 1])

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

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

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

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

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

Solution (Python):
import string
az = list(string.ascii_lowercase)

print(az[az.index(input())+1])

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

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

Solution (Python):
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(input())+1])

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
    
C=input()

i=ord(C)

i=i+1

print(chr(i))

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

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

print("", chr(i))

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

Solution (Python):
char = input().split()

print(chr(ord(char[0])+1))

Solution (Python):
if __name__ == '__main__':
    letter = int(ord(input()))
    print(chr(letter + 1))

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

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

print(chr(ord_a + 1))

Solution (Python):
alphabet="abcdefghijklmnopqrstuvwxyz"
a = str(input())

for i in range(26):
  if a == alphabet[i]:
    print(alphabet[i+1])

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

Solution (Python):
C = input()
list = "abcdefghijklmnopqrstuvwxyz"

f = list.find(C)

print(list[f+1])

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

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

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

Solution (Python):









n=input()
a=ord(n)+1
print(chr(a))

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

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

Solution (Python):
import sys

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines







def main():
	c=input().rstrip().decode('utf-8')
	ans=chr(ord(c)+1)
	print(ans)


if __name__ == "__main__":
	main()

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

Solution (Python):
c = input()
print(chr(ord("a")+(ord(c)-ord("a")+1)%26))

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

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

print(chr(moji))

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

Solution (Python):
inp_char = input()
abc = "abcdefghijklmnopqrstuvwxyz"
ii = 0
for i in abc:
	if i == inp_char:
		out = abc[ii+1]
	else:
		ii+=1
print(out)

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

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

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

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

Solution (Python):


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

Solution (Python):



C = input()
A = [chr(i) for i in range(97,97+26)]

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

Solution (Python):
C = input()

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

print(ans)

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

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

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

Solution (Python):
T = "abcdefghijklmnopqrstuvwsyz"
t = list(T)

a = input()
b = t.index(a) + 1

print(t[b])

Solution (Python):
a = input()
ascii_a = ord(a)

next_ascii_a = ascii_a +1
print(chr(next_ascii_a))

Solution (Python):
from sys import stdin
C = stdin.readline().rstrip()
print(chr(ord(C)+1))

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

Solution (Python):
c = input()

alphabet = "abcdefghijklmnopqrstuvwxyz"
print(alphabet[alphabet.find(c)+1])

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

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

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

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

Solution (Python):
import string

key = input()
alphabet = string.ascii_lowercase
print(alphabet[alphabet.index(key) + 1])

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

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

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

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

x = input()
b = a.index(x)
print(a[b + 1])

Solution (Python):
input_a = input()

input_to_ascii = ord(input_a)

input_to_ascii = input_to_ascii+1

ans_ascii = chr(input_to_ascii)

print(ans_ascii)

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

Solution (Python):

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

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

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


if __name__ == "__main__":
    main()

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

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

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

C = input().strip()

alph = string.ascii_lowercase

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

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

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

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

n=a.find(c)

print(a[n+1:n+2])

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

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

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

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

Solution (Python):
c=input()
S='abcdefghijklmnopqrstuvwxyz'
for i in range(26):
  if c==S[i]:
    print(S[i+1])

Solution (Python):
h = {0: "a",
     1: "b",
     2: "c",
     3: "d",
     4: "e",
     5: "f",
     6: "g",
     7: "h",
     8: "i",
     9: "j",
     10: "k",
     11: "l",
     12: "m",
     13: "n",
     14: "o",
     15: "p",
     16: "q",
     17: "r",
     18: "s",
     19: "t",
     20: "u",
     21: "v",
     22: "w",
     23: "x",
     24: "y",
     25: "z"
     }
swapped = {v: k for k, v in h.items()}
print(h[swapped[input().strip()] + 1])

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

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
import sys


alphabet = "abcdefghijklmnopqrstuvwxyz"

C = input()

for i, c in enumerate(alphabet, 1):
  if c == C:
    print(alphabet[i])
    sys.exit()

Solution (Python):
lis = "abcdefghijklmnopqrstuvwxyz"
 
z = input()
 
for a in range(len(lis)-1):
  if z == lis[a]:
    print(lis[a+1])
    exit()

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

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

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

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

Solution (Python):
C = input()

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

Solution (Python):
def solve(c):
    return chr(ord(c) + 1)

c = input()
print(solve(c))

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

Solution (Python):
C = input()


alp = "abcdefghijklmnopqrstuvwxyz"

for i, string in enumerate(alp):
  if string == C:
    print(alp[i+1])
    break

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

Solution (Python):
C = input()

alpha2num = lambda c: ord(c) - ord('A') + 1
num2alpha = lambda x: chr(x+64)

number = alpha2num(C)
print(num2alpha(number+1))

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

Solution (Python):
alphabet = "abcdefghijklmnopqrstuvwxyz"

print(alphabet[alphabet.index(input()) + 1])

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

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

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

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

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

Solution (Python):
inpstr = input()

base = "abcdefghijklmopqrstuvwxyz"
for i in range(len(base)):
    if base[i] == inpstr:
        print(base[i + 1])

Solution (Python):
c = 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"]

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

Solution (Python):
c = input()

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

Solution (Python):
C = 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']

for i, c in enumerate(alpha):
  if c == C:
    print(alpha[i+1])

Solution (Python):
C = input()

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

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

Solution (Python):
C = input()

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

Solution (Python):


import string
print(string.ascii_lowercase[string.ascii_lowercase.index(input())+1])

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

Solution (Python):
c = input()

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

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

Solution (Python):
b = bytearray(input().encode())[0] + 0x01
print(b.to_bytes(1, 'big' ).decode())

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

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

Solution (Python):
alpha2num = lambda c: ord(c) - ord('A') + 1
num2alpha = lambda c: chr(c+64)

c = input()
c = num2alpha(alpha2num(c)+1)
print(c)

Solution (Python):
string = str(input())
lis = "abcdefghijklmnopqrstuvwxyz"
ind = lis.index(string)
print(lis[ind+1])

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

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

main()

Solution (Python):
alphabet = 'abcdefghijklmnopqrstuvwxyz'
S = input()

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

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

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

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

Solution (Python):
print(chr(ord(input()) + 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):
text = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'

new_alpha = alpha[alpha.find(text) + 1]

print(new_alpha)