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

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main(){

	char input;

	scanf("%c", &input);

	getchar();

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

	return 0;

}
// Slower C++ solution:
//AC



#include<stdio.h>

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main(){

	char input;

	scanf("%c", &input);

	getchar();

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

	return 0;

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

using namespace std;

int main()

{

	char a;

	cin>>a;

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

} 

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



int main(){

	char input;

	scanf("%c", &input);

	getchar();

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

	return 0;

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

using namespace std;

int main()

{

	char a;

	scanf("%c",&a);

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

}

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



int main(){

	char input;

	scanf("%c", &input);

	getchar();

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

	return 0;

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

using namespace std;

int main()

{

    char ch;

    cin >> ch;

    ch=ch+1;

    cout << ch << endl;

    return 0;

}


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



int main(){

	char input;

	scanf("%c", &input);

	getchar();

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

	return 0;

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

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main (){

	char z;

	

	scanf ("%c", &z);

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

	return 0;

}
// Slower C++ solution:
//AC



#include<stdio.h>

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main (){

	char z;

	

	scanf ("%c", &z);

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

	return 0;

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

using namespace std;

int main()

{

	char a;

	cin>>a;

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

} 

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



int main (){

	char z;

	

	scanf ("%c", &z);

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

	return 0;

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

using namespace std;

int main()

{

	char a;

	scanf("%c",&a);

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

}

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



int main (){

	char z;

	

	scanf ("%c", &z);

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

	return 0;

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

using namespace std;

int main()

{

    char ch;

    cin >> ch;

    ch=ch+1;

    cout << ch << endl;

    return 0;

}


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



int main (){

	char z;

	

	scanf ("%c", &z);

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

	return 0;

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

    #define ll long long

    using namespace std;

    int main(){

        char a;

        cin>>a;

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

        return 0;

    }

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



int main (){

	char z;

	

	scanf ("%c", &z);

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

	return 0;

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

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main() {

  char c;

  scanf("%c", &c);

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

  return 0;

}
// Slower C++ solution:
//AC



#include<stdio.h>

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main() {

  char c;

  scanf("%c", &c);

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

  return 0;

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

using namespace std;

int main()

{

	char a;

	cin>>a;

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

} 

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



int main() {

  char c;

  scanf("%c", &c);

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

  return 0;

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

using namespace std;

int main()

{

	char a;

	scanf("%c",&a);

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

}

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



int main() {

  char c;

  scanf("%c", &c);

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

  return 0;

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

using namespace std;

int main()

{

    char ch;

    cin >> ch;

    ch=ch+1;

    cout << ch << endl;

    return 0;

}


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



int main() {

  char c;

  scanf("%c", &c);

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

  return 0;

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

    #define ll long long

    using namespace std;

    int main(){

        char a;

        cin>>a;

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

        return 0;

    }

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



int main() {

  char c;

  scanf("%c", &c);

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

  return 0;

}
// Slower C++ solution:
//بسم الله الرحمن الرحيم

///   ***   ---   |||		 In the name of ALLAH		|||   ---   ***   ///

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define el << endl

#define PI 3.141592653589793238

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

#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)

#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)

ll gcd ( ll  a, ll b ) { return __gcd ( a, b ); }

ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }

int dx[]={0,0,+1,-1,+1,-1,-1,+1};

int dy[]={+1,-1,0,0,+1,-1,+1,-1};

///*......................*//* LET'S BEGIN (-_^) *//*............................///

const int mx= 1e6+123;

char c;



void _case_()

{

    cin >> c;

    cout << char(c+1) el;

   // cout << c << " is followed by " << char(c+1)  << '.' << endl;

}







int main()

{

    optimize();

    //_test_

      _case_();

}



///////////*  N A Y E M  *///////////

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



int main() {

  char c;

  scanf("%c", &c);

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

  return 0;

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

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main()

{

	char C;

	scanf("%c",&C);

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

	

	return 0;	

}
// Slower C++ solution:
//AC



#include<stdio.h>

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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

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

} 

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

	scanf("%c",&a);

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

}

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

    cin >> ch;

    ch=ch+1;

    cout << ch << endl;

    return 0;

}


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

    using namespace std;

    int main(){

        char a;

        cin>>a;

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

        return 0;

    }

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



int main()

{

	char C;

	scanf("%c",&C);

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

	

	return 0;	

}
// Slower C++ solution:
//بسم الله الرحمن الرحيم

///   ***   ---   |||		 In the name of ALLAH		|||   ---   ***   ///

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define el << endl

#define PI 3.141592653589793238

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

#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)

#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)

ll gcd ( ll  a, ll b ) { return __gcd ( a, b ); }

ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }

int dx[]={0,0,+1,-1,+1,-1,-1,+1};

int dy[]={+1,-1,0,0,+1,-1,+1,-1};

///*......................*//* LET'S BEGIN (-_^) *//*............................///

const int mx= 1e6+123;

char c;



void _case_()

{

    cin >> c;

    cout << char(c+1) el;

   // cout << c << " is followed by " << char(c+1)  << '.' << endl;

}







int main()

{

    optimize();

    //_test_

      _case_();

}



///////////*  N A Y E M  *///////////

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



int main()

{

	char C;

	scanf("%c",&C);

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

	

	return 0;	

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



int main() {

	char c;

	std::cin >> c;

	c++;

	std::cout << c << std::endl;

}

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



int main()

{

	char C;

	scanf("%c",&C);

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

	

	return 0;	

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

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

}
// Slower C++ solution:
//AC



#include<stdio.h>

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

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

using namespace std;

int main()

{

	char a;

	cin>>a;

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

} 

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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

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

using namespace std;

int main()

{

	char a;

	scanf("%c",&a);

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

}

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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

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

using namespace std;

int main()

{

    char ch;

    cin >> ch;

    ch=ch+1;

    cout << ch << endl;

    return 0;

}


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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

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

    #define ll long long

    using namespace std;

    int main(){

        char a;

        cin>>a;

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

        return 0;

    }

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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

}
// Slower C++ solution:
//بسم الله الرحمن الرحيم

///   ***   ---   |||		 In the name of ALLAH		|||   ---   ***   ///

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define el << endl

#define PI 3.141592653589793238

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

#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)

#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)

ll gcd ( ll  a, ll b ) { return __gcd ( a, b ); }

ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }

int dx[]={0,0,+1,-1,+1,-1,-1,+1};

int dy[]={+1,-1,0,0,+1,-1,+1,-1};

///*......................*//* LET'S BEGIN (-_^) *//*............................///

const int mx= 1e6+123;

char c;



void _case_()

{

    cin >> c;

    cout << char(c+1) el;

   // cout << c << " is followed by " << char(c+1)  << '.' << endl;

}







int main()

{

    optimize();

    //_test_

      _case_();

}



///////////*  N A Y E M  *///////////

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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

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



int main() {

	char c;

	std::cin >> c;

	c++;

	std::cout << c << std::endl;

}

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

int main (){

char a;

char b;

scanf("%c",&a);

b=a+1;

printf("%c",b);



return 0;

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

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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

int main(){

char C;



scanf("%c", &C);

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



return 0;

}
// Slower C++ solution:
//AC



#include<stdio.h>

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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

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

} 

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

	scanf("%c",&a);

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

}

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

    cin >> ch;

    ch=ch+1;

    cout << ch << endl;

    return 0;

}


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

    using namespace std;

    int main(){

        char a;

        cin>>a;

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

        return 0;

    }

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

int main(){

char C;



scanf("%c", &C);

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



return 0;

}
// Slower C++ solution:
//بسم الله الرحمن الرحيم

///   ***   ---   |||		 In the name of ALLAH		|||   ---   ***   ///

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define el << endl

#define PI 3.141592653589793238

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

#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)

#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)

ll gcd ( ll  a, ll b ) { return __gcd ( a, b ); }

ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }

int dx[]={0,0,+1,-1,+1,-1,-1,+1};

int dy[]={+1,-1,0,0,+1,-1,+1,-1};

///*......................*//* LET'S BEGIN (-_^) *//*............................///

const int mx= 1e6+123;

char c;



void _case_()

{

    cin >> c;

    cout << char(c+1) el;

   // cout << c << " is followed by " << char(c+1)  << '.' << endl;

}







int main()

{

    optimize();

    //_test_

      _case_();

}



///////////*  N A Y E M  *///////////

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

int main(){

char C;



scanf("%c", &C);

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



return 0;

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



int main() {

	char c;

	std::cin >> c;

	c++;

	std::cout << c << std::endl;

}

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

int main(){

char C;



scanf("%c", &C);

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



return 0;

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

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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



int main()

{

	char alphabet;

	scanf ("%c", &alphabet);

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

	return 0;

}
// Slower C++ solution:
//AC



#include<stdio.h>

#include<bits/stdc++.h>

using namespace std;

int main()

{



	char a;

	while(cin>>a)

	{

		cout<<++a<<endl;

	}

}

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

int main()

{

	char a;

	cin>>a;

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

} 

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

	scanf("%c",&a);

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

}

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

int main()

{

    char ch;

    cin >> ch;

    ch=ch+1;

    cout << ch << endl;

    return 0;

}


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



int main()

{

	char alphabet;

	scanf ("%c", &alphabet);

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

	return 0;

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

    #define ll long long

    using namespace std;

    int main(){

        char a;

        cin>>a;

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

        return 0;

    }

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



int main()

{

	char alphabet;

	scanf ("%c", &alphabet);

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

	return 0;

}
// Slower C++ solution:
//بسم الله الرحمن الرحيم

///   ***   ---   |||		 In the name of ALLAH		|||   ---   ***   ///

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define el << endl

#define PI 3.141592653589793238

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

#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)

#define file() freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)

ll gcd ( ll  a, ll b ) { return __gcd ( a, b ); }

ll lcm ( ll a, ll b ) { return a * ( b / gcd ( a, b ) ); }

int dx[]={0,0,+1,-1,+1,-1,-1,+1};

int dy[]={+1,-1,0,0,+1,-1,+1,-1};

///*......................*//* LET'S BEGIN (-_^) *//*............................///

const int mx= 1e6+123;

char c;



void _case_()

{

    cin >> c;

    cout << char(c+1) el;

   // cout << c << " is followed by " << char(c+1)  << '.' << endl;

}







int main()

{

    optimize();

    //_test_

      _case_();

}



///////////*  N A Y E M  *///////////

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



int main()

{

	char alphabet;

	scanf ("%c", &alphabet);

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

	return 0;

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



int main() {

	char c;

	std::cin >> c;

	c++;

	std::cout << c << std::endl;

}

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

	scanf("%c",&b);

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

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

	scanf("%c",&b);

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

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

	scanf("%c",&b);

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

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

	scanf("%c",&b);

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

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

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

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

}