stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
/*

confirm 0LL and 1LL

confirm cornercases such as 0

confirm times of cin < 10^6

*/

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ld = long double;

using P = pair<ll, ll>;

using Pld = pair<ld, ld>;

using Vec = vector<ll>;

using VecP = vector<P>;

using VecB = vector<bool>;

using VecC = vector<char>;

using VecD = vector<ld>;

using VecS = vector<string>;

using VecVec = vector<Vec>;

using Graph = vector<VecP>;

template <typename T>

using Vec1 = vector<T>;

template <typename T>

using Vec2 = vector<Vec1<T> >;

#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))

#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))

#define REPR(i, m, n) for(ll (i) = (m)-1; (i) >= (n); --(i))

#define REPNR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))

#define rep(i, n) REP(i, 0, n)

#define repn(i, n) REPN(i, 1, n)

#define repr(i, n) REPR(i, n, 0)

#define repnr(i, n) REPNR(i, n, 1)

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

#define pb push_back

#define mp make_pair

#define fs first

#define sc second

template <typename T>

bool chmax(T &a, const T& b){if(a < b){a = b; return true;} return false;}

template <typename T>

bool chmin(T &a, const T& b){if(a > b){a = b; return true;} return false;}

template <typename T>

void co(const T n){cout << n << endl;}

template <typename T>

void cosp(const T n){cout << n << ' ';}

void coVec(const Vec &v){for(ll i : v) cosp(i); cout << endl;}

ll in(){ll x; cin >> x; return x;}

void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}

void setp(const ll n){cout << fixed << setprecision(n);}

const ll INF = 1e9+1;

const ll LINF = 1e18+1;

const ll MOD = 1e9+7;

//const ll MOD = 998244353;

const ld PI = acos(-1);

const ld EPS = 1e-11;



int main(void){

	ll n, m;

	cin >> n >> m;

	Vec x(n), y(m);

	rep(i, n) cin >> x[i];

	rep(i, m) cin >> y[i];



	ll sumx = 0;

	rep(i, n){

		sumx += x[i]*(i*2-(n-1));

		sumx %= MOD;

	}

	ll sumy = 0;

	rep(i, m){

		sumy += y[i]*(i*2-(m-1));

		sumy %= MOD;

	}

	co(sumx*sumy%MOD);



	return 0;

}


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

#define MOD 1000000007



int main(void){

	long i, j, n, m;

	scanf("%ld %ld", &n, &m);

	long x[n], y[m];

	for(i = 0; i < n; i++) scanf("%ld", &x[i]);

	for(i = 0; i < m; i++) scanf("%ld", &y[i]);



	long sumx = 0;

	for(i = 0; i < n; i++){

		sumx += x[i]*(i*2-(n-1));

		if(sumx > 1e18 || sumx < -1e18) sumx %= MOD;

	}

	sumx %= MOD;

	long sumy = 0;

	for(i = 0; i < m; i++){

		sumy += y[i]*(i*2-(m-1));

		if(sumy > 1e18 || sumy < -1e18) sumy %= MOD;

	}

	sumy %= MOD;

	printf("%ld\n", sumx*sumy%MOD);



	return 0;

}
// Slower C++ solution:
/*

confirm 0LL and 1LL

confirm cornercases such as 0

confirm times of cin < 10^6

*/

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ld = long double;

using P = pair<ll, ll>;

using Pld = pair<ld, ld>;

using Vec = vector<ll>;

using VecP = vector<P>;

using VecB = vector<bool>;

using VecC = vector<char>;

using VecD = vector<ld>;

using VecS = vector<string>;

using VecVec = vector<Vec>;

using Graph = vector<VecP>;

template <typename T>

using Vec1 = vector<T>;

template <typename T>

using Vec2 = vector<Vec1<T> >;

#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))

#define REPN(i, m, n) for(ll (i) = (m); (i) <= (n); ++(i))

#define REPR(i, m, n) for(ll (i) = (m)-1; (i) >= (n); --(i))

#define REPNR(i, m, n) for(ll (i) = (m); (i) >= (n); --(i))

#define rep(i, n) REP(i, 0, n)

#define repn(i, n) REPN(i, 1, n)

#define repr(i, n) REPR(i, n, 0)

#define repnr(i, n) REPNR(i, n, 1)

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

#define pb push_back

#define mp make_pair

#define fs first

#define sc second

template <typename T>

bool chmax(T &a, const T& b){if(a < b){a = b; return true;} return false;}

template <typename T>

bool chmin(T &a, const T& b){if(a > b){a = b; return true;} return false;}

template <typename T>

void co(const T n){cout << n << endl;}

template <typename T>

void cosp(const T n){cout << n << ' ';}

void coVec(const Vec &v){for(ll i : v) cosp(i); cout << endl;}

ll in(){ll x; cin >> x; return x;}

void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}

void setp(const ll n){cout << fixed << setprecision(n);}

const ll INF = 1e9+1;

const ll LINF = 1e18+1;

const ll MOD = 1e9+7;

//const ll MOD = 998244353;

const ld PI = acos(-1);

const ld EPS = 1e-11;



int main(void){

	sonic();

	ll n, m;

	cin >> n >> m;

	Vec x(n), y(m);

	rep(i, n) cin >> x[i];

	rep(i, m) cin >> y[i];



	ll sumx = 0;

	rep(i, n){

		sumx += x[i]*(i*2-(n-1));

		sumx %= MOD;

	}

	ll sumy = 0;

	rep(i, m){

		sumy += y[i]*(i*2-(m-1));

		sumy %= MOD;

	}

	co(sumx*sumy%MOD);



	return 0;

}


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

#define MOD 1000000007



int main(void){

	long i, j, n, m;

	scanf("%ld %ld", &n, &m);

	long x[n], y[m];

	for(i = 0; i < n; i++) scanf("%ld", &x[i]);

	for(i = 0; i < m; i++) scanf("%ld", &y[i]);



	long sumx = 0;

	for(i = 0; i < n; i++){

		sumx += x[i]*(i*2-(n-1));

		if(sumx > 1e18 || sumx < -1e18) sumx %= MOD;

	}

	sumx %= MOD;

	long sumy = 0;

	for(i = 0; i < m; i++){

		sumy += y[i]*(i*2-(m-1));

		if(sumy > 1e18 || sumy < -1e18) sumy %= MOD;

	}

	sumy %= MOD;

	printf("%ld\n", sumx*sumy%MOD);



	return 0;

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



using namespace std;



int main()

{

    char c;

    cin>>c;

    if(c>='A'&&c<='Z')cout<<'A';

    else cout<<'a';

    return 0;

}


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



int main(){

	char huruf;

	scanf("%c",&huruf);

	huruf >='A'&&huruf<='Z' ? printf("A\n") : printf("a\n");

//	if (huruf >='A' && huruf <='Z'){

//		printf("A\n");

//	}

//	else{

//		printf("a");

//	}

//	return 0;

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



using namespace std;



int main()

{

	char ch;

	cin >> ch;

	if(isupper(ch)) cout << "A\n";

	else cout << "a\n";

	return 0;

}

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



int main() {

  char c;

  scanf("%c", &c);



  if(c >= 'A' && c <= 'Z') {

    printf("A\n");

  } else {

    printf("a\n");

  }



  return 0;

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

#include<string>

using namespace std;

int main(void)

{

    char ch;

    cin>>ch;

    if(ch>='A' && ch<='Z')

    {

        cout<<"A"<<endl;



    }

    else

        {

        cout<<"a"<<endl;



    }



}

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



int main() {

  char c;

  scanf("%c", &c);



  if(c >= 'A' && c <= 'Z') {

    printf("A\n");

  } else {

    printf("a\n");

  }



  return 0;

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

using namespace std;



int main(){



    char a;



    cin >> a;



    if('A'<= a && a<='Z')

        cout << "A" << endl;

    else

        cout << "a" << endl;





}


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



int main() {

  char c;

  scanf("%c", &c);



  if(c >= 'A' && c <= 'Z') {

    printf("A\n");

  } else {

    printf("a\n");

  }



  return 0;

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



using namespace std;



int main()

{

	char ch;

	cin >> ch;

	if(isupper(ch)) cout << "A\n";

	else cout << "a\n";

	return 0;

}

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

int main (){

 

 char huruf [100];

 int i;

 scanf("%c", &huruf);



 if(huruf[i] >= 'A' && huruf [i] <= 'Z'){

  puts("A");

 }

  else{

   puts("a");

  }

 

 return 0;

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

#include<string>

using namespace std;

int main(void)

{

    char ch;

    cin>>ch;

    if(ch>='A' && ch<='Z')

    {

        cout<<"A"<<endl;



    }

    else

        {

        cout<<"a"<<endl;



    }



}

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

int main (){

 

 char huruf [100];

 int i;

 scanf("%c", &huruf);



 if(huruf[i] >= 'A' && huruf [i] <= 'Z'){

  puts("A");

 }

  else{

   puts("a");

  }

 

 return 0;

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

using namespace std;



int main(){



    char a;



    cin >> a;



    if('A'<= a && a<='Z')

        cout << "A" << endl;

    else

        cout << "a" << endl;





}


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

int main (){

 

 char huruf [100];

 int i;

 scanf("%c", &huruf);



 if(huruf[i] >= 'A' && huruf [i] <= 'Z'){

  puts("A");

 }

  else{

   puts("a");

  }

 

 return 0;

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



using namespace std;



int main()

{

	char ch;

	cin >> ch;

	if(isupper(ch)) cout << "A\n";

	else cout << "a\n";

	return 0;

}

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



int main (){

	char alphabet;

	scanf ("%c", &alphabet);

	

	if (alphabet >= 'A' && alphabet <= 'Z'){

		printf ("A");

	}

		 else {

		printf ("a");

	}



	return 0;

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

#include<string>

using namespace std;

int main(void)

{

    char ch;

    cin>>ch;

    if(ch>='A' && ch<='Z')

    {

        cout<<"A"<<endl;



    }

    else

        {

        cout<<"a"<<endl;



    }



}

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



int main (){

	char alphabet;

	scanf ("%c", &alphabet);

	

	if (alphabet >= 'A' && alphabet <= 'Z'){

		printf ("A");

	}

		 else {

		printf ("a");

	}



	return 0;

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

using namespace std;



int main(){



    char a;



    cin >> a;



    if('A'<= a && a<='Z')

        cout << "A" << endl;

    else

        cout << "a" << endl;





}


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



int main (){

	char alphabet;

	scanf ("%c", &alphabet);

	

	if (alphabet >= 'A' && alphabet <= 'Z'){

		printf ("A");

	}

		 else {

		printf ("a");

	}



	return 0;

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

using namespace std;

int main(){

	char tmp;

	cin >> tmp;

	if(tmp>='A' && tmp <='Z')

		cout << 'A' << endl;

	else

		cout << 'a' << endl;

	

	return 0;

} 

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



int main  (){

	int a;

	int A;

	char alpha;



	scanf("%c", &alpha);



	if ( alpha >= 'A' && alpha <= 'Z'){

		printf("A\n");

	}

	else {

		printf("a\n"); 

	}	

	

	return 0;

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

using namespace std;

int main(){

	char tmp;

	cin >> tmp;

	if(tmp>='A' && tmp <='Z')

		cout << 'A' << endl;

	else

		cout << 'a' << endl;

	

	return 0;

} 

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



int main (){

 

 char N [100];

 int i;

 scanf("%c", &N);

 

 if(N[i] >= 'A' && N [i] <= 'Z'){

  puts("A");

 }

  else{

   puts("a");

  }

 

 return 0;

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

using namespace std;

int main(){

	char tmp;

	cin >> tmp;

	if(tmp>='A' && tmp <='Z')

		cout << 'A' << endl;

	else

		cout << 'a' << endl;

	

	return 0;

} 

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



int main (){

	char huruf[10];

	scanf ("%c", &huruf );

	

	int i=0;

 	if(huruf[i] >= 'A'&& huruf[i]<= 'Z') {

    puts ("A");

  }

   else {

    puts ("a");

  }

	

	return 0;

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

using namespace std;

int main()

{

    char ch;

    while(cin>>ch)

    {

        if(ch>='A' && ch<='Z')

        {

            cout<<"A"<<endl;

        }

        else

        {

            cout<<"a"<<endl;

        }

    }

}


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



int main() {

    char a;

    scanf("%c", &a);

    if (a >= 'A' && a <= 'Z') puts("A");

    else puts("a");

    return 0;

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

using namespace std;

int main()

{

    char str[100];

   cin >> str;

    int i,len=0;

    i=0;

    while(str[i]!='\0')

    {

        i++;

        len++;

    }

    for(i=0;i<len;i++)

    {

        if(str[i]>='A'&&str[i]<='Z')

        {

            cout << "A";

        }

        else

        {

            cout << "a";

        }

    }

}


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



int main() {

    char a;

    scanf("%c", &a);

    if (a >= 'A' && a <= 'Z') puts("A");

    else puts("a");

    return 0;

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

using namespace std;

using ll = long long int;

int main()

{

	char c;

	cin>>c;

	cout<<(isupper(c)?'A':'a')<<"\n";

}

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



int main() {

    char a;

    scanf("%c", &a);

    if (a >= 'A' && a <= 'Z') puts("A");

    else puts("a");

    return 0;

}
// Slower C++ solution:
//Let's play once again :)

#include<bits/stdc++.h>

using namespace std;



#define tarzan ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

#define int long long 



int rr[] = {0, 1, 1, 1, 0, -1, -1, -1};

int cc[] = {1, 1, 0, -1, -1, -1, 0, 1};



const int mod = 1e9 + 7;

const int N = 300050;



signed main()

{

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    tarzan;

    int test = 1;

    //cin >> test;

    while(test--) {

        char ch;

        cin >> ch;



        if(ch >= 'A' && ch <= 'Z') {

            cout << 'A';

        }

        else cout << 'a';

    }

    return 0;

}

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



int main() {

    char a;

    scanf("%c", &a);

    if (a >= 'A' && a <= 'Z') puts("A");

    else puts("a");

    return 0;

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

using namespace std;

int main()

{

    char ch;

    while(cin>>ch)

    {

        if(ch>='A' && ch<='Z')

        {

            cout<<"A"<<endl;

        }

        else

        {

            cout<<"a"<<endl;

        }

    }

}


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



int main () {

char a; 

scanf ("%c", &a);

if (a >= 'A' && a <= 'Z'){

	printf("A\n");

	

}

else {

	printf("a\n");

}

return 0;

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

using namespace std;

int main()

{

    char str[100];

   cin >> str;

    int i,len=0;

    i=0;

    while(str[i]!='\0')

    {

        i++;

        len++;

    }

    for(i=0;i<len;i++)

    {

        if(str[i]>='A'&&str[i]<='Z')

        {

            cout << "A";

        }

        else

        {

            cout << "a";

        }

    }

}


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



int main () {

char a; 

scanf ("%c", &a);

if (a >= 'A' && a <= 'Z'){

	printf("A\n");

	

}

else {

	printf("a\n");

}

return 0;

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

using namespace std;

using ll = long long int;

int main()

{

	char c;

	cin>>c;

	cout<<(isupper(c)?'A':'a')<<"\n";

}

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



int main () {

char a; 

scanf ("%c", &a);

if (a >= 'A' && a <= 'Z'){

	printf("A\n");

	

}

else {

	printf("a\n");

}

return 0;

}
// Slower C++ solution:
//Let's play once again :)

#include<bits/stdc++.h>

using namespace std;



#define tarzan ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

#define int long long 



int rr[] = {0, 1, 1, 1, 0, -1, -1, -1};

int cc[] = {1, 1, 0, -1, -1, -1, 0, 1};



const int mod = 1e9 + 7;

const int N = 300050;



signed main()

{

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    tarzan;

    int test = 1;

    //cin >> test;

    while(test--) {

        char ch;

        cin >> ch;



        if(ch >= 'A' && ch <= 'Z') {

            cout << 'A';

        }

        else cout << 'a';

    }

    return 0;

}

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



int main () {

char a; 

scanf ("%c", &a);

if (a >= 'A' && a <= 'Z'){

	printf("A\n");

	

}

else {

	printf("a\n");

}

return 0;

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

using namespace std;

int main()

{

    char ch;

    while(cin>>ch)

    {

        if(ch>='A' && ch<='Z')

        {

            cout<<"A"<<endl;

        }

        else

        {

            cout<<"a"<<endl;

        }

    }

}


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



int main(){

  char let;

  scanf("%c", &let);

  if(let >= 'A' && let <= 'Z'){

    printf("A\n");

  }

  else{

    printf("a\n");

  }

  return 0;

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

using namespace std;

int main()

{

    char str[100];

   cin >> str;

    int i,len=0;

    i=0;

    while(str[i]!='\0')

    {

        i++;

        len++;

    }

    for(i=0;i<len;i++)

    {

        if(str[i]>='A'&&str[i]<='Z')

        {

            cout << "A";

        }

        else

        {

            cout << "a";

        }

    }

}


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



int main(){

  char let;

  scanf("%c", &let);

  if(let >= 'A' && let <= 'Z'){

    printf("A\n");

  }

  else{

    printf("a\n");

  }

  return 0;

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

using namespace std;

using ll = long long int;

int main()

{

	char c;

	cin>>c;

	cout<<(isupper(c)?'A':'a')<<"\n";

}

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



int main(){

  char let;

  scanf("%c", &let);

  if(let >= 'A' && let <= 'Z'){

    printf("A\n");

  }

  else{

    printf("a\n");

  }

  return 0;

}
// Slower C++ solution:
//Let's play once again :)

#include<bits/stdc++.h>

using namespace std;



#define tarzan ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

#define int long long 



int rr[] = {0, 1, 1, 1, 0, -1, -1, -1};

int cc[] = {1, 1, 0, -1, -1, -1, 0, 1};



const int mod = 1e9 + 7;

const int N = 300050;



signed main()

{

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    tarzan;

    int test = 1;

    //cin >> test;

    while(test--) {

        char ch;

        cin >> ch;



        if(ch >= 'A' && ch <= 'Z') {

            cout << 'A';

        }

        else cout << 'a';

    }

    return 0;

}

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



int main(){

  char let;

  scanf("%c", &let);

  if(let >= 'A' && let <= 'Z'){

    printf("A\n");

  }

  else{

    printf("a\n");

  }

  return 0;

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

using namespace std;

int main()

{

    char che;

    while(cin>>che)

    {

        int cnt=0;

        for(char i='A';i<='Z';i++)

        {

            if(che==i)

            {

                cnt=1;

                break;

            }



        }

        if(cnt==1)

            cout<<"A"<<endl;

        else

            cout<<"a"<<endl;

    }

}


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

#include <string.h>



int main(){

	char huruf;

	scanf("%c\n", &huruf);

	

	if(huruf >= 'A' && huruf <= 'Z'){

		puts("A");

	}

	else{

		puts("a");

	}	

	

	return 0;

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

using namespace std;

int main()

{

    char che;

    while(cin>>che)

    {

        int cnt=0;

        for(char i='A';i<='Z';i++)

        {

            if(che==i)

            {

                cnt=1;

                break;

            }



        }

        if(cnt==1)

            cout<<"A"<<endl;

        else

            cout<<"a"<<endl;

    }

}


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



int main() {

	char a;

	scanf("%c", &a);

	if(a >= 'A' && a <= 'Z'){

		puts ("A");

	}

	else{

		puts ("a");

	}

	return 0;

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

using namespace std;

int main()

{

    char che;

    while(cin>>che)

    {

        int cnt=0;

        for(char i='A';i<='Z';i++)

        {

            if(che==i)

            {

                cnt=1;

                break;

            }



        }

        if(cnt==1)

            cout<<"A"<<endl;

        else

            cout<<"a"<<endl;

    }

}


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



int main() {

	char c;



	scanf("%c", &c);



	if('A' <= c && c <= 'Z') puts("A");

	else puts("a");

         

         return 0;

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

using namespace std;

int main()

{

    char che;

    while(cin>>che)

    {

        int cnt=0;

        for(char i='A';i<='Z';i++)

        {

            if(che==i)

            {

                cnt=1;

                break;

            }



        }

        if(cnt==1)

            cout<<"A"<<endl;

        else

            cout<<"a"<<endl;

    }

}


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

int main (){

	

	char name [100];

	int i;

	scanf("%c", &name);



	if(name[i]>= 'A' && name[i]<='Z'){

		puts("A");

	}

		else{

			puts("a");

		}

	

	return 0;

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

using namespace std;

int main()

{

    char che;

    while(cin>>che)

    {

        int cnt=0;

        for(char i='A';i<='Z';i++)

        {

            if(che==i)

            {

                cnt=1;

                break;

            }



        }

        if(cnt==1)

            cout<<"A"<<endl;

        else

            cout<<"a"<<endl;

    }

}


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



int main(){

    char a;

    scanf("%c",&a);

    

    

    if(a>='A'&&a<='Z'){

        printf("A\n");

    }

    else{

        printf("a\n");

    }

    return 0;

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

using namespace std;

int main()

{

    char che;

    while(cin>>che)

    {

        int cnt=0;

        for(char i='A';i<='Z';i++)

        {

            if(che==i)

            {

                cnt=1;

                break;

            }



        }

        if(cnt==1)

            cout<<"A"<<endl;

        else

            cout<<"a"<<endl;

    }

}


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

int main(){

	char a;

	scanf("%c", &a);

	if (a>='A' && a<='Z'){

		printf("A\n");

	}

	else {

                printf("a\n");

	}

	return 0;

}