AtCoder Beginner Contest 151 - Next Alphabet

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.

Source: atcoder | Difficulty: EASY


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


z = input()
A = chr(ord(z) + 1)
print(A)


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


A = input()
B = ord(A)
print(chr(B + 1))


import string
c = input()
abc = list(string.ascii_lowercase)
i = abc.index(c)
print(abc[i + 1])


import string
C = input()
alpha = string.ascii_lowercase
print(alpha[alpha.index(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('\x1b[33m', *a, '\x1b[0m', **dict(file=sys.stderr, **kw))

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


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


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


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


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


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


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


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


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


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


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


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


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


ri = lambda S: [int(v) for v in S.split()]

def rii():
	return ri(input())
C = input()
print(chr(ord(C) + 1))


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


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


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


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


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


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


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


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


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


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


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


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


n = input()
ord_s = ord(n)
chr_s = chr(ord_s + 1)
print(chr_s)


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


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


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


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


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


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


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


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


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


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


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

def __starting_point():
	main()
__starting_point()


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


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


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


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


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