Go: package main

import "fmt"

func alphabetical(b byte) int {
	if 65 <= b && b <= 90 {
		return 1
	}
	if 97 <= b && b <= 122 {
		return 2
	}
	return 0
}

func main() {
	var b byte
	fmt.Scanln(&b)
	fmt.Println(alphabetical(b))
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
#include <cstdlib>
#include <queue>
#include <map>
#include <cstdio>

using namespace std;

typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
//priority_queue<llint,vector<llint>,greater<llint>> que;
//priority_queue<llint> q;

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int n;

void solve(){
  cin >> n;
  if(n>=65 && n<=90)cout << 1;
  else if(n>=97 && n<=122)cout << 2;
  else cout << 0;
  cout << endl;
}

int main() {
  solve();
  return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    if (n >= 'A' && n <= 'Z')
        cout << 1 << '\n';
    else if (n >= 'a' && n <= 'z')
        cout << 2 << '\n';
    else
        cout << 0 << '\n';
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize "O3"
#define rep(i,a,n) for(long long i=a; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const double EPS = 1e-9;
const ll powll = 1LL<<1;

/*
while(!frag && cin >> a >>b, a|b)
*/

int main(void){
    int c;
    cin >> c;
    if(c >=65 && c <= 90) cout << "1\n";
    else if(c >= 97 && c <= 122) cout << "2\n";
    else cout << "0\n";
}

C++: #include<bits/stdc++.h>
#define ll long long

using namespace std;

int main(){
	ll h;
	char c;
	
	cin>>h;
	c=h;
	
	if(c>='A' && c<='Z') cout<<1<<"\n";
		else if(c>='a' && c<='z') cout<<2<<"\n";
			else cout<<0<<"\n";
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    int N; cin >> N;
    if(65 <= N && N <= 90) cout << 1 << '\n';
    else if(97 <= N && N <= 122) cout << 2 << '\n';
    else cout << 0 << '\n';
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
    int n; cin >> n;
    if(n >= 65 && n <= 90) cout << 1 << endl;
    else if(n >= 97 && n <= 122) cout << 2 << endl;
    else cout << 0 << endl;
}

C++: #include<iostream>
using namespace std;
int main() {
int N;
cin >> N;
if(N>='A' && N<='Z')cout << 1 << endl;
else if(N>='a' && N<='z')cout << 2 << endl;
else cout << 0 << endl;
}

C++: #include <iostream>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//using graph = vector<vector<ll>>;


int main() {
	ll n;
	cin >> n;
	if (65 <= n && n <= 90) {
		cout << 1 << endl;
	}
	else if (97 <= n && n <= 122) {
		cout << 2 << endl;
	}
	else {
		cout << 0 << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
using namespace std;
using llong = long long;

int main() {
    int a;

    scanf("%d", &a);

    if (islower(a)) cout << 2 << endl;
    else if (isupper(a)) cout << 1 << endl;
    else cout << 0 << endl;

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  cin>>n;
  if(n<65){
    cout<<0<<'\n';
  }
  else if(n<=90){
    cout<<1<<'\n';
  }
  else if(n<97){
    cout<<0<<'\n';
  }
  else if(n<=122){
    cout<<2<<'\n';
  }
  else{
    cout<<0<<'\n';
  }
  return(0);
}

C++: #include <iostream>
using namespace std;

int main(){
    int N;
    cin >> N;

    if(N >= 65 && N <= 90){
        cout << 1 << endl;
    }else if(N >= 97 && N <= 122){
        cout << 2 << endl;
    }else{
        cout << 0 << endl;
    }

    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    int n; cin>>n;
    if(n>=65&&n<=90) cout<<"1"<<endl;
    else if(n>=97&&n<=122) cout<<"2"<<endl;
    else cout<<"0"<<endl;
    return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
    int N;
    cin >> N;
    if(65<=N&&N<=90){
        cout << "1" << endl;
    }
    else if(97<=N&&N<=122){
        cout << "2" << endl;
    }else{
        cout << "0" << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int n, m = 0;

int main()
{
	cin >> n;

	if (n > 64 && n < 91)
		m = 1;
	else if (n > 96 && n < 123)
		m = 2;

	cout << m << endl;

	return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
    int N;
    cin >> N;
    if(64<N&&N<91){
        cout << "1" << endl;
    }else if(96<N&&N<123){
        cout << "2" << endl;
    }else{
        cout << "0" << endl;
    }

    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
#include<complex>

using namespace std;

#define ll long long
#define ld long double
#define EPS 1e-9
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef pair<int,pii> pip;
typedef vector<pii> vp;
typedef vector<vi> vvi;

int gcd(int a, int b){if(b==0) return a;return gcd(b,a%b);}
int lcm(int a, int b){return a/gcd(a,b)*b;}


signed main(void) {
    int n;
    cin >> n;
    if(65 <= n && n <= 90){
        cout << 1 << endl;
    }else if(97 <= n && n <= 122){
        cout << 2 << endl;
    }else{
        cout << 0 << endl;
    }
}

C++: #include<iostream>
using namespace std;
int main() {
	int a;
	cin >> a ;
	if (65 <= a&&a <= 90) {
		cout << 1 << endl;
	}
	else if (97 <= a&&a <= 122) {
		cout << 2 << endl;
	}
	else {
		cout << 0 << endl;
	}
}

C++: #include<iostream>
using namespace std;
int main(){
    int a;
    cin>>a;
    if('A'<=a&&a<='Z')
        cout<<1<<endl;
    else if('a'<=a&&a<='z')
        cout<<2<<endl;
    else
        cout<<0<<endl;
}

C++: #include<iostream>
#include<string>
#include<set>
#include<utility>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include<stack>
#include<iomanip>

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

#define P pair<int, int>

typedef long long ll;

using namespace std;

#include <string>
#include <cctype>
typedef string::const_iterator State;
class ParseError {};


int main() {
	int a;
	cin >> a;
	if ('A' <= a && a <= 'Z') cout << 1 << endl;
	else if ('a' <= a && a <= 'z') cout << 2 << endl;
	else cout << 0 << endl;

	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;


signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
 
    int n;
    cin>>n;
    if(n>=65 && n<=90){
        cout << 1 << endl;
    }
    else if(n>=97 && n<=122)cout << 2 << endl;
    else cout << 0 << endl;
    
}

C++: #include<iostream>
#include<cmath>

using namespace std;
int main()
{
    int n;
    cin >> n;
    if(n>=65&&n<=90){
        cout << "1" << endl;
    }else if(n>=97&&n<=122){
        cout << "2" << endl;
    }else{
        cout << "0" << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(void){
    int x;
    cin >> x;
    
    if (x>=65 && x<=90) cout << 1 << endl;
    else if (x>=97 && x<=122) cout << 2 << endl;
    else cout << 0 << endl;
    return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int N,a=0;
	scanf("%d",&N);
	if(65<=N&&N<=90){
		a+=1;
	}else if(97<=N&&N<=122){
		a+=2;
	}else{
		a=0;
	}
	printf("%d\n",a);
	return 0;
}