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

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

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

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

Solution (Python):



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

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

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

Solution (Python):
C = input()

for i in range(1, 27):
    if C == chr(i + 96):
        ans = chr(i + 97)
        print(ans)
        exit()

Solution (Python):
def main(input_alphabet):
    al_list = [chr(ord('a') + i ) for i in range(26)]
    for j,alphabet in enumerate(al_list):
        if alphabet == input_alphabet:
            return al_list[j+1]
    
if __name__ == "__main__":
    input_alphabet = input()
    print(main(input_alphabet))

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

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

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

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

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

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

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

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

Solution (Python):


letter = input()
if letter != 'z':
    print(chr(ord(letter) + 1))
else:
    print('a')

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

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

Solution (Python):

C = input()

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

Solution (Python):
C = input()

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

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

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

Solution (Python):
alp = input()
asc = ord(alp)
print(chr(asc + 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","a"]
for i in range(len(a)):
  if(c==a[i]):
    print(a[i+1])
    break

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

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

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

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

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

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

Solution (Python):
x =input()
print(chr(ord(x) + 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','x','y','z']

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

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

Solution (Python):
C = input()

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

Solution (Python):
C = input()

ascii_code = ord(C)
next_character = chr(ascii_code + 1)

print(next_character)

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

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

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','w','x','y','z']
c=input()
print(alfa[alfa.index(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):
c = input()

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

Solution (Python):
C = input()

Alphabet = 'abcdefghijklmnopqrstuvwxyz'
Alphabet_list = [i for i in Alphabet]
print(Alphabet_list[Alphabet_list.index(C)+1])

Solution (Python):
C = input()

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

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

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

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

Solution (Python):
c = input()

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

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

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

Solution (Python):
alph = input("")
if alph == "z":
    print("a")
else:

    ascnum = ord(alph) + 1
    nextalph = chr(ascnum)
    print(nextalph)

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

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):
import string

c = input()

a = list(string.ascii_lowercase)

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

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

alpha = 'abcdefghijklmnopqrstuvwxyz'

for i in range(len(alpha)):
    if c[0] == alpha[i]:
        ans = alpha[i + 1]

print(ans)

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

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

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

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

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

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

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

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

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

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

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"]
C=input()
i=al.index(C)
print(al[i+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()
List = ["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"]
i = List.index(C)
print(List[i + 1])

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

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

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

Solution (Python):

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

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

Solution (Python):
moji = "abcdefghijklmnopqrstuvwxyz"
moji = list(moji)

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

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

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

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

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

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

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

Solution (Python):
def resolve():

    C = input()

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

Solution (Python):
import string
C = str(input())
A = list(string.ascii_lowercase)
for i in range(len(A)):
	if C == A[i]:
		break
print(A[i+1%26])

Solution (Python):
def resolve():
    a = input()

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

Solution (Python):

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

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

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

Solution (Python):
print(chr(ord(input())+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']
z=input()
for i in range(26):
  if z==alphabet[i]:
    print(alphabet[i+1])

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

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

main()

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

ans=List.index(C)
print(List[ans+1])

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

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

Solution (Python):
c = input()
print(chr(ord(c)+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(26):
  if C==S[i]:
    print(S[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):
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys






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

H = readline().decode('utf8').strip()
print(chr(ord(H) + 1))

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

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

Solution (Python):

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

Solution (Python):
C = input()

alp = list(chr(ord('a')+i) for i in range(26))

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

Solution (Python):

alpha = "abcdefghijklmnopqrstuvwxyz"
C = input()
print(alpha[alpha.index(C)+1])

Solution (Python):
c = input()
alp = [chr(ord('a') + i) for i in range(26)]
print(alp[alp.index(c)+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()
print (chr(ord(C)+1))

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

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

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

Solution (Python):
from sys import stdin

def main():
    s = stdin.readline().strip()
    print(chr(ord(s)+1))

main()

Solution (Python):
from sys import stdin

def main():
	l = stdin.readline().strip()
	print(chr(ord(l)+1))
	
main()

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

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

Solution (Python):
N = input()
a_to_z = [chr(i) for i in range(97, 97+26)]
for index, item in enumerate(a_to_z):
    if item == N:
        print(a_to_z[index+1])

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

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

Solution (Python):
C = input()

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

Solution (Python):
import subprocess
args=['bf','Main.py'] 

subprocess.check_call(args)

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

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

Solution (Python):
if __name__ == "__main__":
  _c = input()
  ascii = ord(_c)
  ascii += 1
  print(chr(ascii))

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

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    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']
    S = input()
    print(d[d.index(S) + 1])


if __name__ == '__main__':
    main()

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

Solution (Python):
C = input()

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

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

Solution (Python):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main_0():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


def main():
    C = read_str()
    res = chr(ord(C) + 1)
    print(res)

main()

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

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

ans = alp[alp.find(c)+1]
print(ans)

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

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

Solution (Python):
import string

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

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

Solution (Python):
import numpy as np

def main():
    C = input()
    print('{}'.format(chr(ord(C) + 1)))


if __name__ == '__main__':
    main()

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

Solution (Python):
def ans2(c):
    _c = ord(c)
    print(chr(_c+1))

C = input()

ans2(C)

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

if __name__ == '__main__':
    main()

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

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):


c = input()


c_ascii = ord(c)
c_ascii = c_ascii + 1


ans = chr(c_ascii)

print(ans)

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

Solution (Python):
import string

s = input()

l = list(string.ascii_lowercase)
for i in range(0,26):
    if s == l[i]:
        print(l[i+1])

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):
txt ='abcdefghijklmnopqqrstuvwxyz'
c=input()
print(txt[txt.find(c)+1])

Solution (Python):
C = input()
abc ="abcdefghijklmnopqrstuvwxyz"
a = ""

for i in range(26):
    if C == abc[i]:
        a = abc[i+1]

print(a)

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

Solution (Python):
C = input()
alf=['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==alf[i]:
        print(alf[i+1])

Solution (Python):
C = input()

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

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

Solution (Python):
c = input()
import string
alphStr = string.ascii_lowercase
alph = alphStr.index(c)
print(alphStr[alph+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'];print(l[l.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']
print(l[l.index(input()) + 1])

Solution (Python):




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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
str = input()

print(chr(ord(str)+1))

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

Solution (Python):
import string
C = input()
word = list(string.ascii_lowercase)

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

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

Solution (Python):
alphabet=[chr(i) for i in range(97, 97+26)]
C=input()
num=ord(C)-97
print(alphabet[num+1])

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

C = input()

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

Solution (Python):
import sys

c = sys.stdin.readline().rstrip()
print(chr(ord(c) + 1))

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

Solution (Python):
import string

c = str(input())
l = string.ascii_lowercase
for i in range(len(l)):
  if l[i] == c:
    print(l[i+1])
    break

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

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

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

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

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

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

Solution (Python):

import sys
import string


def solve(C: str):
    print(chr(ord(C) + 1))

    return



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

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

Solution (Python):
p=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']
q=[i for i, x in enumerate(alp) if x==p]
print(alp[q[0]+1])

Solution (Python):
asc = 'abcdefghijklmnopqrstuvwxyz'
t=input()
for i in range(25):
    if t == asc[i]:
        print(asc[i+1])

Solution (Python):
list_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(list_a[list_a.index(c)+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()
print(chr(ord(c)+1))

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

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

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

Solution (Python):
a = input()

letters="abcdefghijklmnopqrstuvwxyza"

index = letters.find(a)

print(letters[index + 1])

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

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

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


alphabet = list('abcdefghijklmnopqrstuvwxyz')

id = alphabet.index(C)

print(alphabet[id+1])

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

Solution (Python):
x = str(input())
print(chr(int(ord(x)+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()
s_1 = ord(s)
s = chr(s_1+1)

print(s)

Solution (Python):



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


main()

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

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

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

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

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

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

Solution (Python):
import sys

row = sys.stdin.readline

def read_string(row):
    return row().rstrip()
  
inp = read_string(row)
print(chr(ord(inp) + 1))

Solution (Python):
C = input()

alp = "abcdefghijklmnopqrstuvwxyz"
alp = list(alp)

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

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

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

Solution (Python):
C = input()

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

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

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

Solution (Python):
c = input()

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

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

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

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

Solution (Python):

import sys


def solve(inp):
    C = inp.readline().strip()

    if C[0] != 'z':
        next = chr(ord(C[0]) + 1)
    else:
        next = 'a'
    return next


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

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):
alp = input()
allalp = 'abcdefghijklmnopqrstuvwxyz'
num = allalp.find(alp)
ans = allalp[num + 1]
print(ans)

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

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

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

Solution (Python):
s = input()    
alp = [chr(ord('a')+i) for i in range(26)]    
cnt = 0        
    
for i in alp:    
    cnt += 1     
    if i == s:    
        print(alp[cnt])

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

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):
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()

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

Solution (Python):
import sys

print(chr(ord(sys.stdin.readline().rstrip('\n')) + 1))

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

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

Solution (Python):
C = input()

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

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

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

Solution (Python):
c = input()

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

Solution (Python):
def main():
    S = input()
    dic = ['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(dic[(dic.index(S) + 1) % 26])


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
inp = input()

import string
alphabets = list(string.ascii_lowercase)

print(alphabets[alphabets.index(inp) + 1])

Solution (Python):
def next():
    literka = input()
    wartosc = ord(literka)
    wartosc += 1 
    print(chr(wartosc))
    
next()

Solution (Python):
C = input()
alphabets = 'abcdefghijklmnopqrstuvwsyz'
out = alphabets.find(C)
print(alphabets[out + 1])

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

Solution (Python):


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

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

C = str(input())

print(list[(list.index(C)+1)%len(list)])

Solution (Python):
C = input()

nb = lambda xx: chr(ord(xx) + 1) 
print(nb(C))

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

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

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

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

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

Solution (Python):
def get_next_char(s):
    """
    >>> get_next_char("a")
    'b'
    >>> get_next_char("y")
    'z'
    """
    next_ord = ord(s)+1
    next_chr = chr(next_ord)
    return next_chr
    
def main():
    s = input().rstrip("\n")
    print( get_next_char(s))

if __name__ == '__main__':
    main()
if __name__ == '__jupyter__':
    import doctest
    print(doctest.testmod())

Solution (Python):
import os

def main():
    char = input()
    list_ = ["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,v in enumerate(list_):
        if char == v:
            print(list_[i+1])

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
def next_alphabet(a):

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

    num = list.index(a)

    return list[num + 1]


def main():
    insert = input()
    print(next_alphabet(insert))


if __name__ == '__main__':
    main()

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

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

Solution (Python):
ch = input()

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

Solution (Python):
a = input()

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

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

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

i = 0
while(1):
    if(s[i] == a):
        break
    i += 1

print(s[i+1])

Solution (Python):
import string
target = list(string.ascii_lowercase)
C = str(input())
print(target[target.index(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):
c = ord(input())
print(chr(c+1))

Solution (Python):


a = input()

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

Solution (Python):
def p_a():
    import string
    l = string.ascii_lowercase
    c = input()
    print(l[l.index(c) + 1])
    
p_a()

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

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

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

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

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

print(a)

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

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

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

print("", chr(i))

Solution (Python):
import sys

def solve(C: str):
    C_asc = ord(C)
    C_next_asc = C_asc + 1
    C_next = chr(C_next_asc)

    print(C_next)
    return
 
if __name__ == "__main__":
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    
    tokens = iterate_tokens()
    C = next(tokens)
    solve(C)

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

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

Solution (Python):
from collections import deque
from itertools import chain, combinations
import json




def main():
    a = "abcdefghijklmnopqrstuvwxyz"
    c=input()
    print(a[a.index(c)+1])

    
    
    
    
    
    
    print()


if __name__ == "__main__":
    main()

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

Solution (Python):
c = input()

print(chr(c.encode()[0]+1))

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

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

Solution (Python):
import sys

input = sys.stdin.readline

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

Solution (Python):
C = input()


def SmallLetters():
    return [chr(i) for i in range(97,97+26)]

SL = SmallLetters()

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

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

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

Solution (Python):
C = input()

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

Solution (Python):
import string

c = input()
al = string.ascii_lowercase

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

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

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

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

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

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

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

Solution (Python):
C = str(input())
alpha2num = lambda c: ord(c) - ord('A') + 1

C_dash = alpha2num(C)

num2alpha = lambda c: chr(c+64)

print(num2alpha(C_dash+1))

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

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

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

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

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

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