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

Solution (Python):



def solve(*args: str) -> str:
    c = args[0]
    return chr(ord(c)+1)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

Solution (Python):


def main():
    alphabets = 'abcdecghijklmnopqrstuvwxyz'
    char = input()
    next_index = alphabets.find(char) + 1
    print(alphabets[next_index])

if __name__ == "__main__":
    main()

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

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

A='abcdefghijklmnopqrstuvwyz'
count = 0
for z in A:
    if N == z:
        print(A[count+1])
    count += 1

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

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

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

t = list(string.ascii_letters)
for i in range(len(t)):
    if t[i] == C:
        print(t[i+1])

Solution (Python):
S='abcdefghijklmnopqrstuvwxyz'
C=input()
for i in range(0,25):
  if S[i]==C:
    print(S[i+1])

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

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

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

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

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

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

Solution (Python):
C = input()
alp = "abcdefghijklmnopqrstuvwxyz"
ind = alp.index(C)
print(alp[ind+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"]
print(a[a.index(c) + 1])

Solution (Python):
c = input()

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

Solution (Python):

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

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

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

print(chr(C + 1))

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

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

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

Solution (Python):
from sys import stdin
N = (stdin.readline().rstrip())
alpha="abcdefghijklmnopqrstuvwxyz"
print(alpha[alpha.index(N)+1])

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
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 input(): return sys.stdin.readline().strip()
def INT(): return int(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()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def gcd(a, b):
  if a < b:
      a, b = b, a
  while a % b != 0:
      a, b = b, a % b
  return b


def lcm(a, b):
  y = a*b / gcd(a, b)
  return int(y)

s = input()
l = [chr(i) for i in range(97, 97+26)]

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

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

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

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

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

if __name__ == "__main__":
    main()

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

Solution (Python):
c = input()

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

Solution (Python):
a = [chr((ord("a") + i)) for i in range(26)]
b = input()
for i in range(len(a)):
  if b == a[i]:
    print(a[i+1])

Solution (Python):
word=[chr(i) for i in range(97,97+26)]
n=input()
for i in range(26):
    if word[i]==n:
        print(word[i+1])
        exit()

Solution (Python):

c = input()

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


for i in range(26):
    if al[i]==c:
        print(al[i+1])
    else:
        pass

Solution (Python):
a = 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):
def main():
    a = input()
    b = ord(a) +1
    print(chr(b))
if __name__=='__main__':
    main()

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

Solution (Python):


import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    C = i2s()
    print(chr(ord(C) + 1))
    return

main()

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

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

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

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

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

Solution (Python):
c = input()
arr = 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".split())

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

Solution (Python):
C = input()

C = ord(C) + 1

print(chr(C))

Solution (Python):
import string

c = input()
a = string.ascii_lowercase

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

print(res)

Solution (Python):
c = input()

alpha2num = lambda c: ord(c) - ord('A') + 1

num2alpha = lambda c: chr(c+64)

print(num2alpha(alpha2num(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']
a = input()
for i in range(len(l)):
    if l[i] == a:
        print(l[i+1])

Solution (Python):
import sys
input = sys.stdin.readline
C = input().rstrip()
al = [chr(i) for i in range(97, 97+26)]
alpha2num = lambda c: ord(c) - ord("a")
print(al[alpha2num(C) + 1])

Solution (Python):

import numpy as np


DEBUG = True
dprint = print if DEBUG else lambda x : x

s = input().strip()

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

Solution (Python):

abc = "abcdefghijklmnopqrstuvwxyz"
c = input()
for i,a in enumerate(abc):
    if a==c:
        break
print(abc[i+1])

Solution (Python):
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    c = [x for x in sys.stdin.readline().split()][0]  
    

    logger.debug('{}'.format([c]))

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


if __name__ == "__main__":
    resolve()




import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """a"""
        output = """b"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """y"""
        output = """z"""
        self.assertIO(input, output)

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

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

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

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

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

Solution (Python):
s=input()

hoge="abcdefghijklmnopqrstuvwxyz"

sl=hoge.index(s)
print(hoge[sl+1])

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

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

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

num += 1
ans = chr(num)

print(ans)

Solution (Python):
c=input()

str='abcdefghijklmnopqrstuvwxyz'

ind=str.find(c)
print(str[ind+1])

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

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

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

Solution (Python):
a='abcdefghijklmnopqrstuvwxyz'
al=[l for l in a]
s=input()
print(al[a.index(s)+1])

Solution (Python):
import string


list_a_z = list(string.ascii_lowercase)

C = input()

for i, c in enumerate(list_a_z):
    if c == C:
        break

print(list_a_z[i+1])

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
c=input()

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

Solution (Python):

from string import ascii_lowercase

c = input()

i = 0
while i<100:
    if ascii_lowercase[i]==c:
        print(ascii_lowercase[i+1])
        exit()
    i += 1

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

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

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

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

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

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

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

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

Solution (Python):
x = input()

s = 'abcdefghijklmnopqrstuvwxyz'

i = s.find(x)

print(s[i+1])

Solution (Python):
c = input()

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

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

Solution (Python):
C = input()

c = chr(ord(C) + 1)

print(c)

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

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

Solution (Python):
a = input()

s = 'abcdefghijklmnopqrstuvwxyz'

if a in s:
    n = s.index(a)
print(s[n+1])

Solution (Python):
c = input()

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

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

Solution (Python):
import queue
import copy
import math



s = input()

alphas = ["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"]

found = False
for a in alphas:
    if s == a:
        found = True
        continue
    if found:
        print(a)
        exit(0)

Solution (Python):
abc = "abcdefghijklmnopqrstuvwxyz"

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

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

Solution (Python):
import sys

def resolve():
    input = sys.stdin.readline
    C=input().rstrip()
    s="abcdefghijklmnopqrstuvwxyz"

    for i in range(len(s)):
        if s[i]==C:
            print(s[i+1])
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """a"""
        output = """b"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """y"""
        output = """z"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

Solution (Python):
c=input()

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

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

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

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

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

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

Solution (Python):
C= input()

CC = ord(C)
CC = CC +1
out = chr(CC)
print(out)

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


if __name__ == "__main__":
    main()

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

S=one_str()

aaa = list('abcdefghijklmnopqrstuvwxyz')

print(aaa[aaa.index(S)+1])

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

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

Solution (Python):

A = str(input())

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

Solution (Python):
alphs = "abcdefghijklmnopqrstuvwxyz"
alph_map = dict(zip(alphs, range(len(alphs))))

alph = input()
ind = alph_map[alph]
print(alphs[ind+1])

Solution (Python):


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

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
X = input()

print(chr(ord(X)+1))

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

for i in range(len(s)):
    if c==s[i]:
        break


print(s[i+1])

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

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

Solution (Python):

s = 'abcdefghijklmnopqrstuvwxyz'
c = input()

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

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

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

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

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

Solution (Python):
c = input()

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

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

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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

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

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

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

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

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

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

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

print(chr(c+1))

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

Solution (Python):
C = input()
lis = "abcdefghijklmnopqrstuvwxyz"
for i,l in enumerate(lis):
    if l == C:
        print(lis[i+1])

Solution (Python):


import sys
import math
import time
import numpy as np
import collections


S = str(raw_input())



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


alpha = [chr(i) for i in range(97, 97+26)]
idx = alpha.index(C)
print(alpha[idx+1])

Solution (Python):
ans = input()

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

Solution (Python):
from string import ascii_lowercase

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

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

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

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


main()

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(C):
    return chr(ord(C) + 1)


def main():
    C = read_str()
    print(slv(C))


if __name__ == '__main__':
    main()

Solution (Python):
c = input()

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

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(chr(ord(c) + 1))

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

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

Solution (Python):
C = input()

alf = list("abcdefghijklmnopqrstuvwxyz")

ind = alf.index(C)
print(alf[ind+1])

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

Solution (Python):

import string

s_list = string.ascii_lowercase
c = input()

ans = s_list[s_list.index(c) + 1]
print(ans)

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

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

index_num = li.index(c)

print(li[index_num + 1])

Solution (Python):
a = input()

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

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

Solution (Python):
c = input()

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

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

print(chr(c+1))

Solution (Python):

C = input()
alphabet = list("abcdefghijklmnopqrstuvwxyz")

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

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

if __name__ == '__main__':
    main()

Solution (Python):
C = input()

abc = list("abcdefghijklmnopqrstuvwxyz")

for i, s in enumerate(abc):
    if C == s:
        print(abc[i+1])
        break