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 in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
//string b="12345";
//a = int(b[4]-48);
using namespace std;
int main()
{
	char C;
	vector<char> A;
	cin >> C;
	A.push_back('a');
	A.push_back('b');
	A.push_back('c');
	A.push_back('d');
	A.push_back('e');
	A.push_back('f');
	A.push_back('g');
	A.push_back('h');
	A.push_back('i');
	A.push_back('j');
	A.push_back('k');
	A.push_back('l');
	A.push_back('m');
	A.push_back('n');
	A.push_back('o');
	A.push_back('p');
	A.push_back('q');
	A.push_back('r');
	A.push_back('s');
	A.push_back('t');
	A.push_back('u');
	A.push_back('v');
	A.push_back('w');
	A.push_back('x');
	A.push_back('y');
	A.push_back('z');
	
	for (int i = 0; i < 25; i++) {
		if (C == A[i]) {
			cout << A[i + 1] << endl;
		}
	}


}