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>
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>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;



int main(){

	int N;

	scanf("%d",&N);

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

		printf("1\n");

	}else if(N >= 'a' && N <= 'z'){

		printf("2\n");

	}else{

		printf("0\n");
	}

	return 0;
}

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

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

C++: #include<stdio.h>
int main(){
  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>
#define rep(i,n) for (int i = 0; i < (n); ++i)
const int INF = 2147483647;//int max
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;


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;
}
/*
やっほい！
　　　　　　　やほほい！
　　　　+　　 　*
　　　 ∧∧　　. ∧∞∧　*
*　ヽ(=´ω｀)人(´ω｀*)ﾉ
　.～（ O x.） （ 　 O)～　+
。*　 　∪　　　　∪
*/

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

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

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

int main() {
  int n;
  cin >> n;
  cout << (65 <= n && n <= 90 ? 1 : (97 <= n && n <= 122 ? 2 : 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>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed 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>

int main() {
  int n;

  std::cin >> n;

  if ('A' <= n && n <= 'Z') {
    std::cout << 1 << std::endl;
  } else if ('a' <= n && n <= 'z') {
    std::cout << 2 << std::endl;
  } else {
    std::cout << 0 << std::endl;
  }

  return 0;
}

C++: #include<iostream>
#include<vector>
#include<cmath>
#define _GLIBCXX_DEBUG
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 (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>
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<bits/stdc++.h>
using namespace std;
int main(){
    int N;
    cin>>N;
    if (65<=N&&N<91){
        cout<<"1"<<endl;
        
    }else if ( 96 <N&& N<123){
        cout<<"2"<<endl;
        
    }else{
        cout<<"0"<<endl;
    }
}

C++: #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
    for (auto &e: vec) {
        is >> e;
    }
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) {
        cout << " ";
    }
    output(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        os << e << delim[&e == &vec.back()];
    }
    return os;
}

template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.setf(ios_base::fixed);
    cout.precision(10);

    var(size_t, N);

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

    return 0;
}