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()
alf="abcdefghijklmnopqrstuvwyz"

for i in range(len(alf)+1):
	if c==alf[i] and c!="z":
		print(alf[i+1])
		break
	elif c== "z":
		print("a")
		break

Solution (Python):
C = input()

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

Solution (Python):
c = input()
s = "abcdefghijklmnopqrstuvwxyz"
flg = True
for i in range(len(s) + 1):
    if c == s[i] and c != "z":
        print(s[i + 1])
        break
    elif c == "z":
        print("a")
        break

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

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

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

Solution (Python):
import string

s = input()

abc = string.ascii_lowercase

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

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

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

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

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

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

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 in range(26):
    if  C == alpha[i]:
        print(alpha[i+1])

Solution (Python):
c = input()

tmp = ord(c)+1

print(chr(tmp))

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

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

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

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

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

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

for nn in alphabet:
  if sorted([aa,nn])[0] == aa and aa != nn:
    print(nn)
    exit()

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):
S = input().strip('\n')
str='abcdefghijklmnopqrstuvwxyz'
for i in range(26):
    if str[i]==S:print(str[i+1])

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

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):


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


if __name__ == "__main__":
    main()

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=str(input())
l="abcdefghijklmnopqrstuvwxyz"
u=l.find(c)
print(l[u+1])

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

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

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

Solution (Python):

import sys
import numpy as np


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

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

Solution (Python):
import string

C = input()
a = string.ascii_lowercase
ind = a.find(C)
print(a[ind+1])

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
C = input()

S = "abcdefghijklmnopqrstuvwxyz"

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

Solution (Python):
import sys
import collections


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    d = collections.defaultdict(str)
    for i in range(97, 97 + 25):
        d[chr(i)] += chr(i+1)
    print(d[str(readline().rstrip().decode('utf-8'))])


if __name__ == '__main__':
    solve()

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

Solution (Python):
x = input()
y = 'abcdefghijklmnopqrstuvwxyz'
from collections import deque
li = deque([])
for i in range(len(y)):
    li.append(y[i:i+1])
b = True
while(b):
    p = li.pop()
    if p == x:
        print(q)
        b = False
    q = p

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

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

Solution (Python):
c = input()

alphabet = 'abcdefghijklmnopqrstuvwxyz'

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

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

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

if len(c)==1 and c!="z":
	print(chr(ord(c)+1))

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

Solution (Python):

c=str(input())

if len(c)==1 and c!="z":
	print(chr(ord(c)+1))

Solution (Python):
c = input()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
c = input()

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

Solution (Python):
C=input()
print(bytes(c+1 for c in C.encode()).decode())

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

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

Solution (Python):
S=input()

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

Solution (Python):
c = input()

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

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

a_str = input()
idx = a.index(a_str)

print(a[idx+1])

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

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

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

Solution (Python):

alphabet = ["dummy", "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 = len(alphabet)

character = input()

i = 0
for i in range(num):
  i = i + 1
  if(alphabet[i] == character):
    break
  else:
    pass

print(alphabet[i+1])

Solution (Python):
a = input()

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

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

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

Solution (Python):
def main():
    from string import ascii_lowercase
    c = input()
    idx = ascii_lowercase.index(c)
    ans = ascii_lowercase[idx + 1]
    print(ans)


if __name__ == '__main__':
    main()

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

Solution (Python):
alpha = 'abcdefghijklmnopqrstuvwxyz'

c = input()
print(alpha[alpha.find(c)+1])

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

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

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

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

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

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    print(chr(ord(input())+1))
    return


if __name__ == "__main__":
    solve()

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

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

Solution (Python):



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

Solution (Python):
C = input()

a = "abcdefghijklmnopqrstuvwxyz"
d = dict()
for i, x in enumerate(a):
    d[x] = i+1
print(a[d[C]])

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

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

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

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

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

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

Solution (Python):
char_list = [ chr(ord('a')+num) for num in range( 26 ) ]

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

Solution (Python):
MI=lambda:map(int,input().split())
LI=lambda:list(MI())

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

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

Solution (Python):
def main():
    S = input()
    from string import ascii_lowercase
    dic = {a: i for i, a in enumerate(ascii_lowercase)}
    rdic = {i: a for i, a in enumerate(ascii_lowercase)}
    print(rdic[dic[S] + 1])


if __name__ == '__main__':
    main()

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

Solution (Python):
from sys import stdin,setrecursionlimit
import string
setrecursionlimit(10 ** 7)
s = stdin.readline().rstrip()
a = string.ascii_lowercase
print(a[a.index(s)+1])

Solution (Python):
from itertools import permutations
import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

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

main()

Solution (Python):

c = input()

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

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

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

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

s = readline().rstrip().decode('utf-8')
print(chr(ord(s)+1))

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
s= input()

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

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

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

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

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

al = string.ascii_lowercase
for i in range(len(al)):
  if al[i] == C:
    print(al[i+1])
    break

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

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

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

Solution (Python):
a = input()

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

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

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

Solution (Python):
a="abcdefghijklmnopqrstuvwxyz"
alpha=list(a)

moji=input()
index=alpha.index(moji)

print(alpha[index+1])

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

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

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

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

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

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

Solution (Python):
import os

def main():
	string = input()
	lists = ["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 = ""
	count = 0
	for i in lists:
		if string == i:
			ans = lists[count+1]
			break
		count += 1
	print(ans)

if __name__ == '__main__':
	main()

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

Solution (Python):
C = input()

def next_to(alphabet):
    alphabets = 'abcdefghijkllmopqrstuvwxyz'
    index_of_alphabet = alphabets.find(alphabet)
    next_to= alphabets[index_of_alphabet + 1]

    return next_to

answer = next_to(C)

print(answer)

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

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

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

C = input()

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

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

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

tmp=ord(s)
tmp+=1

tmp=chr(tmp)

print(tmp)

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

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

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

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):
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(26):
    if c == a[i]:
        print(a[i + 1])

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

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

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

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

alfa_index=alfa.index(C)

print(alfa[alfa_index+1])

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

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

Solution (Python):
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

C = sr()
answer = chr(ord(C) + 1)
print(answer)

Solution (Python):
a=str(input())
A={"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(A[a])

Solution (Python):
a=str(input())
A={"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(A[a])

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

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

Solution (Python):

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

Solution (Python):

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

Solution (Python):
from sys import stdin

C = input()
c = ord(C)

print(chr(c + 1))

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

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

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

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

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

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

Solution (Python):
s=[chr(i) for i in range(97,123)]
c=raw_input()
ans= s.index(c)
print s[ans+1]

Solution (Python):

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

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

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

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

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

Solution (Python):
C = raw_input()

print chr(ord(C)+1)

Solution (Python):

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

Solution (Python):
A=input()

print(chr(ord(A)+1))

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

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

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

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

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

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

Solution (Python):
c = input()
alpha_list =list( 'abcdefghijklamnopqrstuvwxyz')
for i in range(27):
    if alpha_list[i] == c:
        print(alpha_list[i+1])
        break

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

Solution (Python):

import sys

alphabets = 'abcdefghijklmnopqrstuvwxyz'


def solve(C: str):
    print(alphabets[alphabets.index(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):
C=input()
li=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
count=li.index(C)
count=count+1
print(li[count])

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

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

C = input()
idx = AL.find(C)
idy = (idx + 1) % 26
print(AL[idy])

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

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

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

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

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

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

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

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

Solution (Python):


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

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

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

Solution (Python):

c= input()
a_z = [chr(ord('a') + i) for i in range(26)] 

c_indx = a_z.index(c) 
print(a_z[c_indx + 1])

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

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

Solution (Python):

ab = [chr(ord('a') + i) for i in range(26)]
C = input()
for i in range(25):
    if C == ab[i]:
        print(ab[i+1])

Solution (Python):
C = input()
alp = [chr(i) for i in range(97,97+26)]
if C!='z':
    print(alp[alp.index(C)+1])
else:
    print('a')

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

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

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

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

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

main()

Solution (Python):
import sys

c = sys.stdin.readline().rstrip()

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

if __name__ ==  '__main__':
    main()

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

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

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

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

Solution (Python):
c = input()

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
import string

AL = string.ascii_lowercase

C = input()
idx = AL.find(C)
idy = (idx + 1) % 26
print(AL[idy])

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

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

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

Solution (Python):
def main():

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

if __name__ == '__main__':
    print(main())

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

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

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

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

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

Solution (Python):
from sys import stdin

c = stdin.readline().rstrip()

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):
from string import ascii_lowercase as lower
print(lower[lower.find(input())+1])

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

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

Solution (Python):
C = input()

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

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

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

Solution (Python):

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):




def resolve():
    c = input()

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


if __name__ == "__main__":
    resolve()

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

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

Solution (Python):
c = input()

txt = 'abcdefghijklmnopqrstuvwxyz'
for i in range(26):
    if txt[i] == c:
        print(txt[i + 1])

Solution (Python):
A = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
C = input()
for i in range(len(A)):
  if C == A[i]:
    break
print(A[i+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()
A=list('abcdefghijklmnopqrstuvwxyz')
print(A[A.index(C)+1])

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

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

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

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

dic = dict(zip(abc, val))

C = input()

keys = [k for k, v in dic.items() if v == dic[C]+1]
print(keys[0])

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

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

Solution (Python):
c = input()

tmp = ord(c)
tmp += 1

print(chr(tmp))

Solution (Python):
C = input()

Alphabet = 'abcdefghijklmnopqrstuvwxyz'
Alphabet_list = list(Alphabet)

i = 0
while (i < 26):
  if Alphabet_list[i] == C:
    print(Alphabet_list[i+1])
    break
  else:
    i = i+1

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

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

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

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

print(chr(a))

Solution (Python):


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

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

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