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;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second

#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long
#define endl "\n"


signed main(){
  cin.tie(0);	
  ios::sync_with_stdio(false);
  
  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++: // 2020/08/03 Tazoe

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

C++: #include <stdio.h>
int main(void) {
	int N;
	scanf("%d", &N);
	if (65 <= N && N <= 90) {
		printf("1\n");
	}
	else if (97 <= N && N <= 122) {
		printf("2\n");
	}
	else {
		printf("0\n");
	}
	return 0;
}

C++: /*
    アスキー文字
    https://onlinejudge.u-aizu.ac.jp/challenges/sources/PCK/Prelim/0405?year=2019
*/
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    // 65 - 90
    if (65 <= n && n <= 90) {
        cout << 1 << endl;
    } else if (97 <= n && n <= 122) {
        // 97 - 122
        cout << 2 << endl;
    } else {
        cout << 0 << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int 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>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
typedef long long int ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	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 argc, char const *argv[]) {

        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 "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-10;
const double pi = acos(-1);//3.1415926535897932384626433832795028...
const ll SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
ll fac[200005], finv[200005], inv[200005];
vector<ll>dij;
struct edge { ll to, cost; };
vector<vector<edge> >G;

ll mod_pow(ll a, ll b) {
	ll res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}
	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T & t, const V & v) { t = v; }

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T & t, const V & v) {
	for (auto& e : t) fill_v(e, v);
}

template<typename T>
void outp(vector<T>v) {
	for (int i = 0; i < v.size(); ++i) {
		cout << v[i];
		if (i != v.size() - 1) { cout << " "; }
	}
}

double add(double a, double b) {
	if (abs(a + b) < EPS * (abs(a) + abs(b))) { return 0; }
	return a + b;
}

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

C++: #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     @hamayanhamayan
　　　　／　　　＼　 　  |　|
　　　 /　　 /￣￣￣￣/　　|
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
　 　　　＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int N;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;

    if ('A' <= N and N <= 'Z') cout << 1 << endl;
    else if ('a' <= N and N <= 'z') cout << 2 << endl;
    else cout << 0 << endl;
}

C++: #include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;

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

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<bits/stdc++.h>

using namespace std;

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

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

int main()
{
  i64 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;
}