stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



typedef long long ll;



int main() {

	char x;

	cin >> x;

	cout << (char) (++x);

	return 0;

}


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

	int main(){

		char C;

			

		scanf ("%c", &C);

	 	

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

	}
// Slower C++ solution:


#include <bits/stdc++.h>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cstdlib>

#include<string.h>

using namespace std;

#define pb push_back

#define all(v) v. begin(),v. end()

#define  rep(i,n,v) for(i=n;i<v;i++)

#define per(i,n,v) for(i=n;i>v;i--)

#define ff first 

#define ss second 

#define pp pair<ll,ll>

#define ll  long long

#define endl '\n'

void solve()

{

  ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;

  string s, r, y;

  char e;

  cin>>e;

  cout<<++e;

}

int main()

{

 ios_base::sync_with_stdio(false);

  cin. tie(0);cout. tie(0);

    ll t=1;

//   cin>>t;

    while(t--)

    {

      solve();

    }

    return 0;

}

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

	int main(){

		char C;

			

		scanf ("%c", &C);

	 	

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

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

using namespace std;



typedef long long ll;



main()

{

    char c;

    cin >> c;

    c++;

    cout << c ;







}











///promy_pompom

//hello world


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

	int main(){

		char C;

			

		scanf ("%c", &C);

	 	

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

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



using namespace std;

char f(char ch){

  int d = ch-'a' +1;

  return (char)(d+'a');

}

int main ()

{

  	char ch;cin>>ch;

    cout<<f(ch);

    return 0;

}


// 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 character;



    cin >> character;



    cout << (char)((int)character + 1) << endl;





    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.341413619408311x):
#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;

    int a=c;

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

}


// Faster C++ solution for the same problem (measured speedup: 5.320929974025506x):
#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 f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



ll attack(ll ar[10000][10000], ll i, ll j, ll k){

    return ((i+2 < k) && (j+1 < k)) + ((i+2 < k) && (j-1 >= 0)) + ((i-2 >= 0) && (j+1 < k)) + ((i-2 >= 0) && (j-1 >= 0));

}



void solve(){

    char ch;

    cin>>ch;

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

}

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.442649548638705x):
#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;



typedef long long ll;



int main() {

	char x;

	cin >> x;

	cout << (char) (++x);

	return 0;

}


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

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cstdlib>

#include<string.h>

using namespace std;

#define pb push_back

#define all(v) v. begin(),v. end()

#define  rep(i,n,v) for(i=n;i<v;i++)

#define per(i,n,v) for(i=n;i>v;i--)

#define ff first 

#define ss second 

#define pp pair<ll,ll>

#define ll  long long

#define endl '\n'

void solve()

{

  ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;

  string s, r, y;

  char e;

  cin>>e;

  cout<<++e;

}

int main()

{

 ios_base::sync_with_stdio(false);

  cin. tie(0);cout. tie(0);

    ll t=1;

//   cin>>t;

    while(t--)

    {

      solve();

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3984989176042175x):
#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;



typedef long long ll;



main()

{

    char c;

    cin >> c;

    c++;

    cout << c ;







}











///promy_pompom

//hello world


// 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;

char f(char ch){

  int d = ch-'a' +1;

  return (char)(d+'a');

}

int main ()

{

  	char ch;cin>>ch;

    cout<<f(ch);

    return 0;

}


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

int main()

{

	char n;

	scanf("%s",&n);

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

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

using namespace std;





int main()

{

    char character;



    cin >> character;



    cout << (char)((int)character + 1) << endl;





    return 0;

}


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

int main()

{

	char n;

	scanf("%s",&n);

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

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

using namespace std;

int main()

{

    char c;

    cin>>c;

    int a=c;

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

}


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

int main()

{

	char n;

	scanf("%s",&n);

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

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

using namespace std;



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

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



ll attack(ll ar[10000][10000], ll i, ll j, ll k){

    return ((i+2 < k) && (j+1 < k)) + ((i+2 < k) && (j-1 >= 0)) + ((i-2 >= 0) && (j+1 < k)) + ((i-2 >= 0) && (j-1 >= 0));

}



void solve(){

    char ch;

    cin>>ch;

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

}

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

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

int main()

{

	char n;

	scanf("%s",&n);

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

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

using namespace std;



typedef long long ll;



int main() {

	char x;

	cin >> x;

	cout << (char) (++x);

	return 0;

}


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

int main()

{

	char n;

	scanf("%s",&n);

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

}
// Slower C++ solution:


#include <bits/stdc++.h>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cstdlib>

#include<string.h>

using namespace std;

#define pb push_back

#define all(v) v. begin(),v. end()

#define  rep(i,n,v) for(i=n;i<v;i++)

#define per(i,n,v) for(i=n;i>v;i--)

#define ff first 

#define ss second 

#define pp pair<ll,ll>

#define ll  long long

#define endl '\n'

void solve()

{

  ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;

  string s, r, y;

  char e;

  cin>>e;

  cout<<++e;

}

int main()

{

 ios_base::sync_with_stdio(false);

  cin. tie(0);cout. tie(0);

    ll t=1;

//   cin>>t;

    while(t--)

    {

      solve();

    }

    return 0;

}

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

int main()

{

	char n;

	scanf("%s",&n);

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

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

using namespace std;



typedef long long ll;



main()

{

    char c;

    cin >> c;

    c++;

    cout << c ;







}











///promy_pompom

//hello world


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

int main()

{

	char n;

	scanf("%s",&n);

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

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



using namespace std;

char f(char ch){

  int d = ch-'a' +1;

  return (char)(d+'a');

}

int main ()

{

  	char ch;cin>>ch;

    cout<<f(ch);

    return 0;

}


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



int main(){

	char alphabet;

	scanf("%c", &alphabet);

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

	

	return 0;

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

using namespace std;





int main()

{

    char character;



    cin >> character;



    cout << (char)((int)character + 1) << endl;





    return 0;

}


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



int main(){

	char alphabet;

	scanf("%c", &alphabet);

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

	

	return 0;

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

using namespace std;

int main()

{

    char c;

    cin>>c;

    int a=c;

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

}


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



int main(){

	char alphabet;

	scanf("%c", &alphabet);

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

	

	return 0;

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

using namespace std;



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

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



ll attack(ll ar[10000][10000], ll i, ll j, ll k){

    return ((i+2 < k) && (j+1 < k)) + ((i+2 < k) && (j-1 >= 0)) + ((i-2 >= 0) && (j+1 < k)) + ((i-2 >= 0) && (j-1 >= 0));

}



void solve(){

    char ch;

    cin>>ch;

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

}

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

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



int main(){

	char alphabet;

	scanf("%c", &alphabet);

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

	

	return 0;

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

using namespace std;



typedef long long ll;



int main() {

	char x;

	cin >> x;

	cout << (char) (++x);

	return 0;

}


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



int main(){

	char alphabet;

	scanf("%c", &alphabet);

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

	

	return 0;

}
// Slower C++ solution:


#include <bits/stdc++.h>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cstdlib>

#include<string.h>

using namespace std;

#define pb push_back

#define all(v) v. begin(),v. end()

#define  rep(i,n,v) for(i=n;i<v;i++)

#define per(i,n,v) for(i=n;i>v;i--)

#define ff first 

#define ss second 

#define pp pair<ll,ll>

#define ll  long long

#define endl '\n'

void solve()

{

  ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;

  string s, r, y;

  char e;

  cin>>e;

  cout<<++e;

}

int main()

{

 ios_base::sync_with_stdio(false);

  cin. tie(0);cout. tie(0);

    ll t=1;

//   cin>>t;

    while(t--)

    {

      solve();

    }

    return 0;

}

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



int main(){

	char alphabet;

	scanf("%c", &alphabet);

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

	

	return 0;

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

using namespace std;



typedef long long ll;



main()

{

    char c;

    cin >> c;

    c++;

    cout << c ;







}











///promy_pompom

//hello world


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



int main(){

	char alphabet;

	scanf("%c", &alphabet);

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

	

	return 0;

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



using namespace std;

char f(char ch){

  int d = ch-'a' +1;

  return (char)(d+'a');

}

int main ()

{

  	char ch;cin>>ch;

    cout<<f(ch);

    return 0;

}


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



int main () {

	int huruf;

	scanf("%c", &huruf);

	

	huruf = huruf + 1;

	printf("%c", huruf);

	

	return 0;

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

using namespace std;





int main()

{

    char character;



    cin >> character;



    cout << (char)((int)character + 1) << endl;





    return 0;

}


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



int main () {

	int huruf;

	scanf("%c", &huruf);

	

	huruf = huruf + 1;

	printf("%c", huruf);

	

	return 0;

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

using namespace std;

int main()

{

    char c;

    cin>>c;

    int a=c;

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

}


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



int main () {

	int huruf;

	scanf("%c", &huruf);

	

	huruf = huruf + 1;

	printf("%c", huruf);

	

	return 0;

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

using namespace std;



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

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



ll attack(ll ar[10000][10000], ll i, ll j, ll k){

    return ((i+2 < k) && (j+1 < k)) + ((i+2 < k) && (j-1 >= 0)) + ((i-2 >= 0) && (j+1 < k)) + ((i-2 >= 0) && (j-1 >= 0));

}



void solve(){

    char ch;

    cin>>ch;

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

}

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

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



int main () {

	int huruf;

	scanf("%c", &huruf);

	

	huruf = huruf + 1;

	printf("%c", huruf);

	

	return 0;

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

using namespace std;



typedef long long ll;



int main() {

	char x;

	cin >> x;

	cout << (char) (++x);

	return 0;

}


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



int main () {

	int huruf;

	scanf("%c", &huruf);

	

	huruf = huruf + 1;

	printf("%c", huruf);

	

	return 0;

}
// Slower C++ solution:


#include <bits/stdc++.h>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cstdlib>

#include<string.h>

using namespace std;

#define pb push_back

#define all(v) v. begin(),v. end()

#define  rep(i,n,v) for(i=n;i<v;i++)

#define per(i,n,v) for(i=n;i>v;i--)

#define ff first 

#define ss second 

#define pp pair<ll,ll>

#define ll  long long

#define endl '\n'

void solve()

{

  ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;

  string s, r, y;

  char e;

  cin>>e;

  cout<<++e;

}

int main()

{

 ios_base::sync_with_stdio(false);

  cin. tie(0);cout. tie(0);

    ll t=1;

//   cin>>t;

    while(t--)

    {

      solve();

    }

    return 0;

}

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



int main () {

	int huruf;

	scanf("%c", &huruf);

	

	huruf = huruf + 1;

	printf("%c", huruf);

	

	return 0;

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

using namespace std;



typedef long long ll;



main()

{

    char c;

    cin >> c;

    c++;

    cout << c ;







}











///promy_pompom

//hello world


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



int main () {

	int huruf;

	scanf("%c", &huruf);

	

	huruf = huruf + 1;

	printf("%c", huruf);

	

	return 0;

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



using namespace std;

char f(char ch){

  int d = ch-'a' +1;

  return (char)(d+'a');

}

int main ()

{

  	char ch;cin>>ch;

    cout<<f(ch);

    return 0;

}


// 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 character;



    cin >> character;



    cout << (char)((int)character + 1) << endl;





    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.341413619408311x):
#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;

    int a=c;

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

}


// Faster C++ solution for the same problem (measured speedup: 5.320929974025506x):
#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 f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



ll attack(ll ar[10000][10000], ll i, ll j, ll k){

    return ((i+2 < k) && (j+1 < k)) + ((i+2 < k) && (j-1 >= 0)) + ((i-2 >= 0) && (j+1 < k)) + ((i-2 >= 0) && (j-1 >= 0));

}



void solve(){

    char ch;

    cin>>ch;

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

}

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.442649548638705x):
#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;



typedef long long ll;



int main() {

	char x;

	cin >> x;

	cout << (char) (++x);

	return 0;

}


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

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cstdlib>

#include<string.h>

using namespace std;

#define pb push_back

#define all(v) v. begin(),v. end()

#define  rep(i,n,v) for(i=n;i<v;i++)

#define per(i,n,v) for(i=n;i>v;i--)

#define ff first 

#define ss second 

#define pp pair<ll,ll>

#define ll  long long

#define endl '\n'

void solve()

{

  ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;

  string s, r, y;

  char e;

  cin>>e;

  cout<<++e;

}

int main()

{

 ios_base::sync_with_stdio(false);

  cin. tie(0);cout. tie(0);

    ll t=1;

//   cin>>t;

    while(t--)

    {

      solve();

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3984989176042175x):
#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;



typedef long long ll;



main()

{

    char c;

    cin >> c;

    c++;

    cout << c ;







}











///promy_pompom

//hello world


// 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;

char f(char ch){

  int d = ch-'a' +1;

  return (char)(d+'a');

}

int main ()

{

  	char ch;cin>>ch;

    cout<<f(ch);

    return 0;

}


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

int main(){

	char A;

	scanf("%c",&A);

	 A += 1 ;

	printf("%c",A);

	

	

	

	

	return 0;

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

using namespace std;





int main()

{

    char character;



    cin >> character;



    cout << (char)((int)character + 1) << endl;





    return 0;

}


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

int main(){

	char A;

	scanf("%c",&A);

	 A += 1 ;

	printf("%c",A);

	

	

	

	

	return 0;

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

using namespace std;

int main()

{

    char c;

    cin>>c;

    int a=c;

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

}


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

int main(){

	char A;

	scanf("%c",&A);

	 A += 1 ;

	printf("%c",A);

	

	

	

	

	return 0;

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

using namespace std;



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

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



ll attack(ll ar[10000][10000], ll i, ll j, ll k){

    return ((i+2 < k) && (j+1 < k)) + ((i+2 < k) && (j-1 >= 0)) + ((i-2 >= 0) && (j+1 < k)) + ((i-2 >= 0) && (j-1 >= 0));

}



void solve(){

    char ch;

    cin>>ch;

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

}

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

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

int main(){

	char A;

	scanf("%c",&A);

	 A += 1 ;

	printf("%c",A);

	

	

	

	

	return 0;

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

using namespace std;



typedef long long ll;



int main() {

	char x;

	cin >> x;

	cout << (char) (++x);

	return 0;

}


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

int main(){

	char A;

	scanf("%c",&A);

	 A += 1 ;

	printf("%c",A);

	

	

	

	

	return 0;

}