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<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
#include<numeric>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const int mod=998244353 ;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-10;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
//17:00~

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

C++: #include<cstdio>
#include<algorithm>
using namespace std;
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++: #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;
    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 <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)

int main() {
    int n; cin >> n;
    char c = char(n);
    int ans;
    if (isupper(c)) ans = 1;
    else if (islower(c)) ans = 2;
    else ans = 0;
    cout << ans << endl;
}

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

C++: #include<bits/stdc++.h>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define MOD 1000000007
#define INF 1e9
#define F first
#define S second
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

int main(void){
    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 >= 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 As;
    cin >> As;
    if((65<=As)&&(As<=90)){
        cout << "1" << endl;
    }else if((97<=As)&&(As<=122)){
        cout << "2" << endl;
    }else{
        cout << "0" << endl;
    }
}

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

#define ASC(vec) vec.begin(), vec.end()    // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例：sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)

const int       mod = 1000000007;
const int       inf = (1 << 21);
const long long INF = 1LL << 60;

using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vii = vector<pair<int, int>>;
using vll = vector<pair<ll, ll>>;

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; }
template<class T>
T GCD(T a, T b) { if (b == 0) return a; else return GCD(b, a % b); }
template<class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }

constexpr array<int, 9> dx = { 0, 1, 0, -1, -1, 1, 1, -1, 0 };
constexpr array<int, 9> dy = { 1, 0, -1, 0, 1, 1, -1, -1, 0 };

// ──────────────────────────────────────────────────────────────────

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

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

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>
#include<string>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
	int N, a;
	cin >> N;
	if (N <= 90&&N>=65) {
		a = 1;
	}
	else if (N >= 97 && N <= 122) {
		a = 2;
	}
	else {
		a = 0;

	}
	cout << a << endl;
	return 0;
}