Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		line := scanner.Text()
		n, _ := strconv.Atoi(line)
		var result int
		if 65 <= n && n <= 90 {
			result = 1
		} else if 97 <= n && n <= 122 {
			result = 2
		} else {
			result = 0
		}
		fmt.Printf("%v\n", result)
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vi2 = vector<vector<int>>;
using vb = vector<bool>;
using vb2 = vector<vector<bool>>;
using vc = vector<char>;
using vc2 = vector<vector<char>>;
using vs = vector<string>;
using si = set<int>;
using vs2 = vector<vector<string>>;
using pii = pair<int, int>;
using mii = map<int, int>;
const int INF = 1e9;
const ll LINF = 1e18;
const long double PI = acos(-1.0);
#define MP(a,b) make_pair((a),(b))
#define MT(...) make_tuple(__VA_ARGS__)
#define sz(x) (int)(x).size()
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
 
#define ALL(x) (x).begin(),(x).end()
#define SORT(v) sort(ALL(v));
#define IN(type,a) type a;cin >> a;
#define VIN(type,a,n) vector<type> a(n);cin >> a;
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl;
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl;
#define COUT(x) cout << (x) << endl;
#define DCOUT(x,n) cout << fixed << setprecision(n) << (x) << endl;
#define ENDL cout << endl;
#define DB(s,x) cout << (s) << " : " << x << endl;

#define HOGE COUT("HOGE")

template<typename T>inline istream& operator>>(istream&i,vector<T>&v)
{REP(j,sz(v))i>>v[j];return i;}

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;}
int main() {
    int a;
    cin >> a ;
    if (a >= 65 && a <= 90) {
        COUT(1);
    }else if (a >= 97 && a <= 122) {
        COUT(2);
    }else{
        COUT(0);
    }
}

C++: #include <iostream>

using namespace std;

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

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;
    }
    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 <bits/stdc++.h>
using namespace std;

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

C++: #include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int main(void)
{
	int n;
	scanf("%d",&n);
	if(n>=65 && n<=90)	printf("1\n");
	else if(n>=97 && n<=122)	printf("2\n");
	else printf("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;
	}

	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 <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int ctoi(char c) {
  if (c >= '0' && c <= '9') {
    return c - '0';
  }
  return 0;
}
ll factorial(ll n) {
  if (n == 1) {
    return 1;
  }
  ll ans = factorial(n-1);
  return ans*n;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
  return (a/gcd(a, b))*b;
}
bool is_prime(ll n) {
  for (ll i = 2; i*i <= n; i++) {
    if (n%i == 0) return false;
  }
  return n != 1;
}
ll mod_pow(ll x, ll n, ll mod) {
  if (n == 0) return 1;
  ll res = mod_pow(x*x%mod, n/2, mod);
  if (n & 1) res = res * x % mod;
  return res;
}

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

C++: #include<bits/stdc++.h>
#include <array>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;

void Solve(){
    UL ans = 0;
    UL a; cin >> a;
    if(65 <= a && a <= 90) ans = 1;
    if(97 <= a && a <= 122) ans = 2;
    cout << ans << endl;
}

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

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

#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
template<class T> using V = vector<T>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
const int inf = (1<<30)-1;
const ll infll = (1LL<<62)-1;
ll ceil(const ll &a, const ll &b){return ((a)+(b)-1)/b;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }



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

C++: #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <stack>
#include <istream>
#include <map>
#include <set>
#include <queue>
#include <functional>
#define rep0(i,n) for (int i = 0; i < (n); ++i)  //0スタート
#define rep1(i,n) for (int i = 1; i < (n); ++i)  //1スタート
#define REP(i,a,b) for (int i = a; i < (b); ++i)  //aからb - 1まで
#define mREP(i,a,b) for (int i = a; i > (b); --i)  //aからb - 1まで
#define p(x) cout<<x<<endl  //xを改行付きで出力
const int INF = 1000000007;  //最大値兼MOD
//  cin.tie(0);
//  ios::sync_with_stdio(false);
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main(){
  int n;
  cin >> n;
  if(65 <= n && n <= 90)p(1);
  else if(97 <= n && n <= 122)p(2);
  else p(0);
  return 0;
}

C++: #include <cstdio>
int main() {
    int N; scanf("%d", &N);
    if(65 <= N and N <= 90) puts("1");
    else if(97 <= N and N <= 122) puts("2");
    else puts("0");
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(void){
	int n;
	cin >> n ;
	if('A' <= n && n <= 'Z')		cout << 1 << endl;
	else if('a' <= n && n <= 'z')	cout << 2 << endl;
	else							cout << 0 << endl;
	return 0;
}