stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

	char c;

	cin>>c;

	cout<<++c;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include <stdio.h>

int main ()

{

	char x;

	scanf("%c",&x);

	printf("%c",x+1);

	

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 char a;

 cin>>a;

cout<<++a;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include <stdio.h>

int main ()

{

	char x;

	scanf("%c",&x);

	printf("%c",x+1);

	

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{ 

     char c;

     int a ;

     cin>>c;

     a = (int )c;

     cout<<(char)(a+1);

     return 0;

}

     


// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include <stdio.h>

int main ()

{

	char x;

	scanf("%c",&x);

	printf("%c",x+1);

	

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=0;i<n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

     char alpa;

     cin>>alpa;

     int asi=alpa;

     asi++;

     char answer=asi;

     cout<<answer<<endl;

     













}

// Faster C++ solution for the same problem (measured speedup: 5.411393023091611x):
#include <stdio.h>

int main ()

{

	char x;

	scanf("%c",&x);

	printf("%c",x+1);

	

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	char c,x;

	cin>>c; 

	x=c+1;	

	cout<<x;



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.319978086093288x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

    char a;

    cin >> a;

    cout << (char)(a+1);

}

// Faster C++ solution for the same problem (measured speedup: 5.319978086093288x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int mod = (1 ? 1e9+7 : 998244353);







int main()

{

	ios::sync_with_stdio(false); cin.tie(0);

	ll a, b, c, d, e, f, g, T;

	char z;

	cin >> z;

	z++;

	cout << z << endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.41557056736843x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

	char c;

	cin>>c;

	cout<<++c;

}

// Faster C++ solution for the same problem (measured speedup: 5.320087527746656x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 char a;

 cin>>a;

cout<<++a;

}

// Faster C++ solution for the same problem (measured speedup: 5.320087527746656x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{ 

     char c;

     int a ;

     cin>>c;

     a = (int )c;

     cout<<(char)(a+1);

     return 0;

}

     


// Faster C++ solution for the same problem (measured speedup: 5.319978086093288x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=0;i<n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

     char alpa;

     cin>>alpa;

     int asi=alpa;

     asi++;

     char answer=asi;

     cout<<answer<<endl;

     













}

// Faster C++ solution for the same problem (measured speedup: 5.409824493952055x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define ll long long

#define vl vector<ll int>

#define vs vector<string>

#define v vector<int>

#define mi map<int,int>

#define mc map<char,int>

//ios_base::sync_with_stdio(false);cin.tie(NULL);



using namespace std;



int main(){

	ios_base::sync_with_stdio(false);cin.tie(NULL);

	char get,res;

	cin>>get;

	res=get+1;

	cout<<res;

}


// Faster C++ solution for the same problem (measured speedup: 5.400230683971969x):
#include<stdio.h>





int main(){

	

	char C;

	scanf("%c",&C);

	

	if(C==122){

		printf("eror\n");

	}

	

	printf("%c",C+1);

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	char c,x;

	cin>>c; 

	x=c+1;	

	cout<<x;



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

    char a;

    cin >> a;

    cout << (char)(a+1);

}

// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int mod = (1 ? 1e9+7 : 998244353);







int main()

{

	ios::sync_with_stdio(false); cin.tie(0);

	ll a, b, c, d, e, f, g, T;

	char z;

	cin >> z;

	z++;

	cout << z << endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.417140762529426x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

	char c;

	cin>>c;

	cout<<++c;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 char a;

 cin>>a;

cout<<++a;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{ 

     char c;

     int a ;

     cin>>c;

     a = (int )c;

     cout<<(char)(a+1);

     return 0;

}

     


// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=0;i<n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

     char alpa;

     cin>>alpa;

     int asi=alpa;

     asi++;

     char answer=asi;

     cout<<answer<<endl;

     













}

// Faster C++ solution for the same problem (measured speedup: 5.411393023091611x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define ll long long

#define vl vector<ll int>

#define vs vector<string>

#define v vector<int>

#define mi map<int,int>

#define mc map<char,int>

//ios_base::sync_with_stdio(false);cin.tie(NULL);



using namespace std;



int main(){

	ios_base::sync_with_stdio(false);cin.tie(NULL);

	char get,res;

	cin>>get;

	res=get+1;

	cout<<res;

}


// Faster C++ solution for the same problem (measured speedup: 5.4017964314740565x):
#include<stdio.h>



int main(){

	char C;

	scanf("%c", &C);

	printf("%c", C + 1);



	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	char c,x;

	cin>>c; 

	x=c+1;	

	cout<<x;



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

    char a;

    cin >> a;

    cout << (char)(a+1);

}

// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int mod = (1 ? 1e9+7 : 998244353);







int main()

{

	ios::sync_with_stdio(false); cin.tie(0);

	ll a, b, c, d, e, f, g, T;

	char z;

	cin >> z;

	z++;

	cout << z << endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.417140762529426x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

	char c;

	cin>>c;

	cout<<++c;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 char a;

 cin>>a;

cout<<++a;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{ 

     char c;

     int a ;

     cin>>c;

     a = (int )c;

     cout<<(char)(a+1);

     return 0;

}

     


// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=0;i<n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

     char alpa;

     cin>>alpa;

     int asi=alpa;

     asi++;

     char answer=asi;

     cout<<answer<<endl;

     













}

// Faster C++ solution for the same problem (measured speedup: 5.411393023091611x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define ll long long

#define vl vector<ll int>

#define vs vector<string>

#define v vector<int>

#define mi map<int,int>

#define mc map<char,int>

//ios_base::sync_with_stdio(false);cin.tie(NULL);



using namespace std;



int main(){

	ios_base::sync_with_stdio(false);cin.tie(NULL);

	char get,res;

	cin>>get;

	res=get+1;

	cout<<res;

}


// Faster C++ solution for the same problem (measured speedup: 5.4017964314740565x):
#include<stdio.h>

int main()

{

	char a;

	scanf("%c",&a);

	printf("%c",a+1);

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	char c,x;

	cin>>c; 

	x=c+1;	

	cout<<x;



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307415890864957x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

    char a;

    cin >> a;

    cout << (char)(a+1);

}

// Faster C++ solution for the same problem (measured speedup: 5.307415890864957x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int mod = (1 ? 1e9+7 : 998244353);







int main()

{

	ios::sync_with_stdio(false); cin.tie(0);

	ll a, b, c, d, e, f, g, T;

	char z;

	cin >> z;

	z++;

	cout << z << endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.402782647260653x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

	char c;

	cin>>c;

	cout<<++c;

}

// Faster C++ solution for the same problem (measured speedup: 5.307525074091055x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 char a;

 cin>>a;

cout<<++a;

}

// Faster C++ solution for the same problem (measured speedup: 5.307525074091055x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{ 

     char c;

     int a ;

     cin>>c;

     a = (int )c;

     cout<<(char)(a+1);

     return 0;

}

     


// Faster C++ solution for the same problem (measured speedup: 5.307415890864957x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=0;i<n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

     char alpa;

     cin>>alpa;

     int asi=alpa;

     asi++;

     char answer=asi;

     cout<<answer<<endl;

     













}

// Faster C++ solution for the same problem (measured speedup: 5.3970501421889x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define ll long long

#define vl vector<ll int>

#define vs vector<string>

#define v vector<int>

#define mi map<int,int>

#define mc map<char,int>

//ios_base::sync_with_stdio(false);cin.tie(NULL);



using namespace std;



int main(){

	ios_base::sync_with_stdio(false);cin.tie(NULL);

	char get,res;

	cin>>get;

	res=get+1;

	cout<<res;

}


// Faster C++ solution for the same problem (measured speedup: 5.387478986308513x):
#include <stdio.h>



int main(){

	char a;

	

	scanf("%c", &a);

	printf("%c\n", a+1);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	char c,x;

	cin>>c; 

	x=c+1;	

	cout<<x;



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

    char a;

    cin >> a;

    cout << (char)(a+1);

}

// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int mod = (1 ? 1e9+7 : 998244353);







int main()

{

	ios::sync_with_stdio(false); cin.tie(0);

	ll a, b, c, d, e, f, g, T;

	char z;

	cin >> z;

	z++;

	cout << z << endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.417140762529426x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

	char c;

	cin>>c;

	cout<<++c;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 char a;

 cin>>a;

cout<<++a;

}

// Faster C++ solution for the same problem (measured speedup: 5.321630038473499x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{ 

     char c;

     int a ;

     cin>>c;

     a = (int )c;

     cout<<(char)(a+1);

     return 0;

}

     


// Faster C++ solution for the same problem (measured speedup: 5.321520565088524x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=0;i<n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

     char alpa;

     cin>>alpa;

     int asi=alpa;

     asi++;

     char answer=asi;

     cout<<answer<<endl;

     













}

// Faster C++ solution for the same problem (measured speedup: 5.411393023091611x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define ll long long

#define vl vector<ll int>

#define vs vector<string>

#define v vector<int>

#define mi map<int,int>

#define mc map<char,int>

//ios_base::sync_with_stdio(false);cin.tie(NULL);



using namespace std;



int main(){

	ios_base::sync_with_stdio(false);cin.tie(NULL);

	char get,res;

	cin>>get;

	res=get+1;

	cout<<res;

}


// Faster C++ solution for the same problem (measured speedup: 5.4017964314740565x):
#include <stdio.h>





int main () {

    

    

    

    char a;

    scanf("%c", &a);

    printf("%c",a+1);

    

    

    

    

    

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	char c,x;

	cin>>c; 

	x=c+1;	

	cout<<x;



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.322288141681136x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

    char a;

    cin >> a;

    cout << (char)(a+1);

}

// Faster C++ solution for the same problem (measured speedup: 5.322288141681136x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int mod = (1 ? 1e9+7 : 998244353);







int main()

{

	ios::sync_with_stdio(false); cin.tie(0);

	ll a, b, c, d, e, f, g, T;

	char z;

	cin >> z;

	z++;

	cout << z << endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.417922131387694x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

	char c;

	cin>>c;

	cout<<++c;

}

// Faster C++ solution for the same problem (measured speedup: 5.32239763085656x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 char a;

 cin>>a;

cout<<++a;

}

// Faster C++ solution for the same problem (measured speedup: 5.32239763085656x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{ 

     char c;

     int a ;

     cin>>c;

     a = (int )c;

     cout<<(char)(a+1);

     return 0;

}

     


// Faster C++ solution for the same problem (measured speedup: 5.322288141681136x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=0;i<n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

     char alpa;

     cin>>alpa;

     int asi=alpa;

     asi++;

     char answer=asi;

     cout<<answer<<endl;

     













}

// Faster C++ solution for the same problem (measured speedup: 5.41217356289544x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include <bits/stdc++.h>

#define ll long long

#define vl vector<ll int>

#define vs vector<string>

#define v vector<int>

#define mi map<int,int>

#define mc map<char,int>

//ios_base::sync_with_stdio(false);cin.tie(NULL);



using namespace std;



int main(){

	ios_base::sync_with_stdio(false);cin.tie(NULL);

	char get,res;

	cin>>get;

	res=get+1;

	cout<<res;

}


// Faster C++ solution for the same problem (measured speedup: 5.4025755870646694x):
#include <stdio.h>



int main()

{

    char C,result;

    scanf("%c", &C);

    result = C + 1;

    printf("%c", result);



}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	char c,x;

	cin>>c; 

	x=c+1;	

	cout<<x;



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.320857109594301x):
#include <stdio.h>



int main()

{

	char x;

	scanf("%c", &x);

	printf("%c", x+1);

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

    char a;

    cin >> a;

    cout << (char)(a+1);

}

// Faster C++ solution for the same problem (measured speedup: 5.320857109594301x):
#include <stdio.h>



int main()

{

	char x;

	scanf("%c", &x);

	printf("%c", x+1);

	

	return 0;

}
// Slower C++ solution:
#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int inf = 0x3f3f3f3f;

const int mod = (1 ? 1e9+7 : 998244353);







int main()

{

	ios::sync_with_stdio(false); cin.tie(0);

	ll a, b, c, d, e, f, g, T;

	char z;

	cin >> z;

	z++;

	cout << z << endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.416465385678407x):
#include <stdio.h>



int main()

{

	char x;

	scanf("%c", &x);

	printf("%c", x+1);

	

	return 0;

}