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):
c = str(input())
alp = [chr(i) for i in range(97, 97+26)]

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

Solution (Python):
chs = 'abcdefghijklmnopqrstuvwxyz'
s = input()
for i,c in enumerate(chs):
    if s == c:
        print(chs[i+1])
        break

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

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

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

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

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

if __name__ == "__main__":
    main()

Solution (Python):
import sys
import string

C = input()

if C == 'z' : sys.exit()

pos = string.ascii_lowercase.index(C)+1
print(string.ascii_lowercase[pos])

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

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

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

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]

def main():
    C = str(input())

    n = ord(C) - ord('A') + 1

    ans = chr(n+64+1)

    print(ans)

if __name__ == "__main__":
	main()

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

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):
C=input()

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

Solution (Python):
alps = list("abcdefghijklmnopqrstuxyz")
C = input()
for i in range(len(alps)):
  if alps[i] == C:
    print(alps[i+1])

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

Solution (Python):
c = input()

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

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

Solution (Python):
InputStr = input()
A = InputStr[0]
B = ord(A)+1
C = chr(B)
print("%s" % C)

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

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

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

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

Solution (Python):
n = input()
b = ord(n)
print(chr(b+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):
x = input()
n = ord(x)
res = chr(n+1)
print(res)

Solution (Python):
st = input()
code = ord(st)
next_code = code + 1
print(chr(next_code))

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

s=input()
a="abcdefghijklmnopqrstuvwxyz"
print(a[a.index(s)+1])

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

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

print(D)

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

Solution (Python):

import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	
	sys.stdin = open(name)

a = str(input())

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

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

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

print(chr(c+1))

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

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

Solution (Python):
a_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(a_l[a_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):
print(chr(ord(input())+1))

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

Solution (Python):
c = input()

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

Solution (Python):
l ='abcdefghijklmnopqrstuvwxyz'

c = input()

x = l.index(c)

print(l[x + 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('')
for a in range(25):
    if l[a]==c:
        print(l[a+1])

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

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

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

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

Solution (Python):
a = input()

b = ord(a)

print(chr(b+1))

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

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

Solution (Python):


"""
https://atcoder.jp/contests/abc151/tasks/abc151_a
Next Alphabate
"""

def solve(c):
    ans = ord(c)
    return chr(ans+1)

if __name__ == "__main__":
    c = input()
    print(solve(c))

Solution (Python):


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

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

Solution (Python):
c = input()

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

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

Solution (Python):
C = input()
 
print(chr(ord(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()
l=0
for i in AL:
  if N==i:
    print(AL[l+1])
  else:
    l+=1

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

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

if c in l:
    print(l[ord(c)+1-97])

else:
    pass

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

Solution (Python):
a = input()

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

Solution (Python):
print(__import__('string').ascii_lowercase[ord(input())-ord('a')+1])

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

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

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

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

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

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

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

Solution (Python):
C = input()

c = ord(C)+1

print(chr(c))

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

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

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

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

Solution (Python):







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

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

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

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

Solution (Python):
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
C = readline().decode().rstrip()
print(chr((ord(C)+1)))

Solution (Python):
alphabet = 'abcdefghijklmnopqrstuvwxyz'

C = input()

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

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

print(chr(C))

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

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

Solution (Python):
l = list('abcdefghijklmnopqrstuvwsyz')
C = input()
i = l.index(C)
print(l[i+1])

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline
sys.setrecursionlimit(10**7)
inf = 10**17
mod = 10**9+7

c = input().rstrip()
ords = ord(c)
ords += 1
chars = chr(ords)
print(chars)

Solution (Python):
c = input()

alphabets = 'abcdefghijklmnopqrstuvwxyz'
index = alphabets.index(c)
print(alphabets[index+1])

Solution (Python):
print(chr(ord(input())+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)-1):
    if A[i]==C:
        print(A[i+1])
        break

Solution (Python):
C = input()

alphabet = 'abcdefghijklmnopqrstuvwxyza'

idx = alphabet.index(C)
answer = alphabet[idx + 1]

print(answer)

Solution (Python):
C = input()

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    C = readline().strip()
    print(chr(ord(C) + 1))
    
    return


if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

Solution (Python):
C = input()

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

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

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

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

Solution (Python):









import os
import sys




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


if __name__ == "__main__":
    main()

Solution (Python):
C = input()
ord_s = ord(C)
if ord_s >=122:
  ord_s=97
else:
  ord_s+=1
print(chr(ord_s))

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

Solution (Python):
N = input()

order = ord(N)
print(chr(order + 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):

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

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

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

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

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):
l = [chr(ord('a')+i) for i in range(26)]
C = str(input())

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

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

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

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

Solution (Python):
c=input()

alpha=ord(c)

print(chr(alpha+1))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
ch = input().rstrip()

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
alpha="abcdefghijklmnopqrstuvwxyz"
inp=input()
def split(w):
    return [all for all in w]
alpha=split(alpha)
x=alpha.index(inp)
try:
    print(alpha[x+1])
except:
    print("a")

Solution (Python):
def main():
    a = str(input())
    alphabet = 'abcdefghijklmnopqrstuvwxyz'
    print(alphabet[alphabet.index(a) + 1])
main()

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

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

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

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

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

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

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

Solution (Python):


c = input()
x = ord(c)

print(chr(x+1))

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

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

Solution (Python):
from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
from fractions import gcd
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

c = input()
abc = string.ascii_lowercase
for i in range(len(abc)):
    if c == abc[i]:
        ans = abc[i+1]

print(ans)

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

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

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

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

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

Solution (Python):
moji="abcdefghijklmnopqrstuvwxyz"
C=input()
x=[]
for i in range(26):
  x.append(moji[i])
print(x[x.index(C)+1])

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

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

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

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

Solution (Python):
C=input()
result=1
lst=[]
lst.extend('abcdefghijklmnopqrstuvwxyz')
for i in lst:
    if i != C:
        result+=1
    else:
        result+=0
        break
print(lst[result])

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

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

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

Solution (Python):

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

Solution (Python):
C = input()



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

Solution (Python):
C = input()

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

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

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

c=input()

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

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

Solution (Python):
C = input()
num = ord(C)

print(chr(num+1))

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

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

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

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

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

if __name__ == '__main__':
    solve()

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

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

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

Solution (Python):


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

Solution (Python):
ch = raw_input()
print(chr(ord(ch) + 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):
C = input()
S = 'abcdefghijklmnopqrstuvwxyz'
for i in range(len(S)):
  if S[i] == C:
    break
print(S[i+1])

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

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

Solution (Python):
s = input()
ret = ord(s) + 1
print("{}".format(chr(ret)))

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

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

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

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

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

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

for j in range(25):
  if l[j] == c:
    print(l[j+1])
    exit()

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

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

Solution (Python):
C=str(input())
a=ord(C)
print(chr(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","x","y","z"]
for i in range(len(a)):
    if a[i]==c:
        print(a[i+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):
import string
c = input()
abc_list = list(string.ascii_lowercase)
for num,string in enumerate(abc_list):
  if string == c:
    print(abc_list[num+1])

Solution (Python):
C=input()
Alphabet="abcdefghijklmnopqrstuvwxyz"
ans = Alphabet[Alphabet.find(C)+1]
print(ans)

Solution (Python):
print('abcdefghijklmnopqrstuvwxyz'['abcdefghijklmnopqrstuvwxyz'.index(input())+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"]

N = Alp.index(input())
print(Alp[N+1])

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

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

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

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

Solution (Python):
c = input()
alf = 'abcdefghijklmnopqrstuvwxyz'

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

Solution (Python):
c = str(input())
a = 'abcdefghijklmnopqrstuvwxyz'
for i, letter in enumerate(a):
    if c == letter:
        ans = a[i+1]
print(ans)

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

Solution (Python):
c = input()

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

Solution (Python):
print(chr(ord(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"]
s=input()
print(l[l.index(s)+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','w','x','y','z']
for i in range(len(alphabet)):
    if c==alphabet[i]:
        print(alphabet[i+1])

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

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

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

if __name__ == '__main__':
    main()

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

def main():
    c = input()
    str = list('abcdefghijklmnopqrstuvwxyz')
    print(str[str.index(c)+1])

if __name__ == '__main__':
    main()

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

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

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

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

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

print(chr(a+1))

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

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

print(alfa[alfa.index(let)+1])

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

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

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

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

    
if __name__ == "__main__":
    main()

Solution (Python):
a = "abcdefghijklmnopqrstuvwyz"

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

Solution (Python):

alpha="abcdefghijklmnopqrstuvwxyz"
C=input()
for i in range(len(alpha)):
    if alpha[i]==C:
        print(alpha[i+1])

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

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

Solution (Python):
C = input()


print(chr(ord(C[0]) + 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']

ABC_len=len(ABC)

for i in range(ABC_len):
  if C==ABC[i]:
    print(ABC[i+1])

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    c = input()
    ans = chr(ord(c) + 1)
    print(ans)


if __name__ == '__main__':
    solve()

Solution (Python):
C=input()
table=["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(26):
  if(C==table[i]):
    print(table[i+1])

Solution (Python):
c = input()

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
a = input()
a = ord(a)
print(chr(a+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):
import string
l=string.ascii_lowercase
c=input()
for i in range(len(l)):
  if l[i]==c:
    print(l[i+1])

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

Solution (Python):
c = input()

c = chr(ord(c) + 1)

print(c)

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

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

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

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

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

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    c =  input()
    a = "abcdefghijklmnopqrstuvwxyz"
    for i in range(25):
        if a[i] == c:
            print(a[i+1])
            return

main()

Solution (Python):
abc = {'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'}
c = input()
print(abc[c])

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']

if c in list:
    print(list[list.index(c) + 1])

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

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

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    c = readline().strip()

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
C = input()

N = ord(C)

print(chr(N + 1))

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

Solution (Python):
def main():
  num = input()
  print(chr(ord(num[0])+1))

main()

Solution (Python):

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

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

Solution (Python):
c = input()

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

Solution (Python):
C = input()
letters = 'abcdefghijklmnopqrstuxyz'
print(letters[(letters.index(C)+1)])

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

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

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

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

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

Solution (Python):
c = input()
alpha_list = 'abcdefghijkfmnopqrstuvrxyz'

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

Solution (Python):
x = 'abcdefghijklmnopqrstuvwxyz'
c = str(input())
for i,data in enumerate(x):
  if data == c:
    print(x[i+1])
    break

Solution (Python):
c = input()

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

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

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

main()

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

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

Solution (Python):
c = input()

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

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

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()
D = chr(ord(C)+1)
print(D)

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

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

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

Solution (Python):

import sys

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


def main():
    C = readline().rstrip().decode()
    print(chr(ord(C) + 1))


if __name__ == '__main__':
    main()

Solution (Python):
ac = input()
acc ='abcdefghijklmnopqrstuvwxyz'
print(acc[acc.index(ac) + 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"]

c = input()

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

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

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

Solution (Python):
C = input()

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

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

Solution (Python):
C = input()

NEXT = ord(C) + 1

print(chr(NEXT))

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):
def main():
    n = input()
    x = "abcdefghijklmnopqrstuvwxyz"
    
    print(x[x.index(n)+1])

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  

C = S()

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

Solution (Python):
c = input()

a = ord(c)

a += 1
print(chr(a))

Solution (Python):
alphabets = [chr(i) for i in range(97,123)]  
cnt = input()
if cnt in alphabets:
    x = alphabets.index(cnt)+1
    print(alphabets[x])

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

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

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

for i in range(0, len(l)):
    if c == l[i]:
        print(l[i+1])
    else:
        i+=1

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

Solution (Python):
x = input()
alpha2num = lambda c: ord(c) - ord('a') + 1
num2alpha = lambda c: chr(c+96+1)
a = alpha2num(x)
b = num2alpha(a)
print(b)

Solution (Python):
import string

C = input()

a_z = string.ascii_lowercase
print(a_z[a_z.index(C) + 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"]
inde = l.index(C)
print(l[inde+1])

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

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

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

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

Solution (Python):
s1 = input()

print(chr(ord(s1) + 1))

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

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

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

Solution (Python):
C = input()

S = 'abcdefghijklmnopqrstuvwxyz'

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

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

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

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

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

Solution (Python):
c = input()
alphs= [chr(ord('a') + i) for i in range(26)]
for i in range(26):
    if c == alphs[i]:
        print(alphs[i+1])