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-----
a

-----Sample Output-----
b

a is followed by b.

Difficulty: introductory

Starter code:

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

C = input()
word = [chr(i) for i in range(97, 97+26)]
count = 0
for i in range( len(word) ):
  if C == word[i]:
    count = i
print(word[count+1])

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

asd=input()
dfg=["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(dfg[dfg.index(asd)+1])

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


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

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

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

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

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

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

print('abcdefghijklmnopqrstuvwxyz'['abcdefghijklmnopqrstuvwxyz'.find(input())+1])

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


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

C = input()
 
# 文字列と数値の変換
# ord('文字') / chr(数値) で変換
print(chr(ord(C)+1))

S = 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"]
x = alphabet.index(S)
print(alphabet[x+1])

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

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

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

c = input()
s = list('abcdefghijklmnopqrstuvwxyz')

for i in range(25):
    if c == s[i]:
        print(s[i+1])
        return

c = input()
s = list('abcdefghijklmnopqrstuvwxyz')

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

import string
sl = string.ascii_lowercase
print(sl[sl.find(input())+1])

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

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

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

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

c=ord(input())

print(chr(c+1))

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


C = input()

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

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

c=input()
letters="abcdefghijklmnopqrstuvwxyz"
for i in range(26):
    if c==letters[i]:
        print(letters[i+1])

#!/usr/bin/env python3


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


def main():
    C = input().strip()
    answer = solve(C)
    print(answer)


def __starting_point():
    main()

__starting_point()

c = input()

a = "abcdefghigklmnopqrstuvwxyz"

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


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

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

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

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

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

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

a1=A.index(C)+1

print(A[a1])

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

C = input()
alpha = list('abcdefghijklmnopqrstuvwxyz')

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

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

C = input()

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

# coding: utf-8
# Your code here!
s=input()
ans=ord(s)+1
print((chr(ans)))


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

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

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

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

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


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

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

# coding: utf-8
# Your code here!
s = input()

ord_s = ord(s)
ans = ord_s + 1

print(chr(ans))

ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
 
C = input()
print(chr(ord(C)+1))

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

c = input()

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

alp = 'abcdefghijklmnopqrstuvwxyz'

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


C=input()
st='abcdefghijklmnopqrstuvwxyz'

print(st[st.find(C)+1])

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

l=list("abcdefghijklmnopqrstuvwxyz")
ans=input()
for i in range(len(l)):
    if l[i]==ans:
        print(l[i+1])
        break

c=input()
num=ord(c)
if num!=122:
    print(chr(num+1))
else:
    print('a')

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

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

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

kk = al.index(C)

print((al[kk+1]))


C = input()

# 文字列と数値の変換
# ord('文字') / chr(数値) で変換できる
ord_s = ord(C)
chr_s = chr(ord_s + 1)

print(chr_s)

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

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


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

def __starting_point():
    main()
__starting_point()

C = input()
word = 'abcdefghijklmnopqrstuvwxyz'
i = word.find(C)
print(word[i+1])

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

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

j = 0
for i in alpha:
    if i == C:
        print(alpha[j+1])
    j += 1

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

C=input()
al=[]
for idx in range(97,123):
  al.append(chr(idx))
idx = al.index(C)
print(al[idx+1])

import string
c = input()
abc=list(string.ascii_lowercase)
i = abc.index(c)

print(abc[i+1])

C = input()

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

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

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

C = input()

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

C = input()

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

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

import math
import collections
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

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

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

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

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

n = input()

ord_s = ord(n)

chr_s = chr(ord_s + 1)

print(chr_s)

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

c = input()

c = chr(ord(c)+1)

print(c)

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

C = str(input())
data = 'abcdefghijklmnopqrstuvwxyz'

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

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

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

C = str(input())

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

import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    s = input()
    return chr(ord(s) + 1)


print(solve())


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

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


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

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

S = input()

X = "abcdefghijklmnopqrstuvwxyz"

M = X.index(S)
print(X[M+1])

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

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