Go: package main

import (
	"bufio"
	"errors"
	"fmt"
	"io"
	"math"
	"os"
	"strconv"
)

/*********** I/O ***********/

var (
	// ReadString returns a WORD string.
	ReadString func() string
	stdout     *bufio.Writer
)

func init() {
	ReadString = newReadString(os.Stdin)
	stdout = bufio.NewWriter(os.Stdout)
}

func newReadString(ior io.Reader) func() string {
	r := bufio.NewScanner(ior)
	// r.Buffer(make([]byte, 1024), int(1e+11)) // for AtCoder
	r.Buffer(make([]byte, 1024), int(1e+9)) // for Codeforces
	// Split sets the split function for the Scanner. The default split function is ScanLines.
	// Split panics if it is called after scanning has started.
	r.Split(bufio.ScanWords)

	return func() string {
		if !r.Scan() {
			panic("Scan failed")
		}
		return r.Text()
	}
}

// ReadInt returns an integer.
func ReadInt() int {
	return int(readInt64())
}
func ReadInt2() (int, int) {
	return int(readInt64()), int(readInt64())
}
func ReadInt3() (int, int, int) {
	return int(readInt64()), int(readInt64()), int(readInt64())
}
func ReadInt4() (int, int, int, int) {
	return int(readInt64()), int(readInt64()), int(readInt64()), int(readInt64())
}

// ReadInt64 returns as integer as int64.
func ReadInt64() int64 {
	return readInt64()
}
func ReadInt64_2() (int64, int64) {
	return readInt64(), readInt64()
}
func ReadInt64_3() (int64, int64, int64) {
	return readInt64(), readInt64(), readInt64()
}
func ReadInt64_4() (int64, int64, int64, int64) {
	return readInt64(), readInt64(), readInt64(), readInt64()
}

func readInt64() int64 {
	i, err := strconv.ParseInt(ReadString(), 0, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// ReadIntSlice returns an integer slice that has n integers.
func ReadIntSlice(n int) []int {
	b := make([]int, n)
	for i := 0; i < n; i++ {
		b[i] = ReadInt()
	}
	return b
}

// ReadInt64Slice returns as int64 slice that has n integers.
func ReadInt64Slice(n int) []int64 {
	b := make([]int64, n)
	for i := 0; i < n; i++ {
		b[i] = ReadInt64()
	}
	return b
}

// ReadFloat64 returns an float64.
func ReadFloat64() float64 {
	return float64(readFloat64())
}

func readFloat64() float64 {
	f, err := strconv.ParseFloat(ReadString(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// ReadFloatSlice returns an float64 slice that has n float64.
func ReadFloat64Slice(n int) []float64 {
	b := make([]float64, n)
	for i := 0; i < n; i++ {
		b[i] = ReadFloat64()
	}
	return b
}

// ReadRuneSlice returns a rune slice.
func ReadRuneSlice() []rune {
	return []rune(ReadString())
}

/*********** Debugging ***********/

// ZeroPaddingRuneSlice returns binary expressions of integer n with zero padding.
// For debugging use.
func ZeroPaddingRuneSlice(n, digitsNum int) []rune {
	sn := fmt.Sprintf("%b", n)

	residualLength := digitsNum - len(sn)
	if residualLength <= 0 {
		return []rune(sn)
	}

	zeros := make([]rune, residualLength)
	for i := 0; i < len(zeros); i++ {
		zeros[i] = '0'
	}

	res := []rune{}
	res = append(res, zeros...)
	res = append(res, []rune(sn)...)

	return res
}

// Strtoi is a wrapper of strconv.Atoi().
// If strconv.Atoi() returns an error, Strtoi calls panic.
func Strtoi(s string) int {
	if i, err := strconv.Atoi(s); err != nil {
		panic(errors.New("[argument error]: Strtoi only accepts integer string"))
	} else {
		return i
	}
}

// PrintIntsLine returns integers string delimited by a space.
func PrintIntsLine(A ...int) string {
	res := []rune{}

	for i := 0; i < len(A); i++ {
		str := strconv.Itoa(A[i])
		res = append(res, []rune(str)...)

		if i != len(A)-1 {
			res = append(res, ' ')
		}
	}

	return string(res)
}

// PrintIntsLine returns integers string delimited by a space.
func PrintInts64Line(A ...int64) string {
	res := []rune{}

	for i := 0; i < len(A); i++ {
		str := strconv.FormatInt(A[i], 10) // 64bit int version
		res = append(res, []rune(str)...)

		if i != len(A)-1 {
			res = append(res, ' ')
		}
	}

	return string(res)
}

// PrintDebug is wrapper of fmt.Fprintf(os.Stderr, format, a...)
func Pri

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

int main() {
	int n;
	cin >> n;
	if(n == 0 || n == 2)
		cout << 1 << endl;
	else if(n == 1)
		cout << 2 << endl;
	else
		cout << 0 << endl;
}

C++: #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>

using namespace std;

int main(){
	cin >> x;
	if(x==0) cout << 1 << endl;
	else if(x==1) cout << 2 << endl;
	else if(x==2) cout << 1 << endl;
	else cout << 0 << endl;
	return 0;
}

C++: import math
def sieve (n):
	prime = [0,0]
	prime += [1 for i in range(n-1)]
	ub = math.sqrt(n) + 1
	d = 2
	while d <= ub:
		if prime[d] == 0:
			d += 1
			continue
		prod = 2
		while d * prod <= n:
			prime[d*prod] = 0
			prod += 1
		d += 1
	return prime
n = int(raw_input())
pn = 1
for i in range(n):
	pn *= 2
prime = sieve(pn*100)
pn += 1
while 1:
	if prime[pn] == 1:
		break
	pn += 1
print int(format(2**(pn-1)-1, "b")) % pn

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

int main(){
int n;
cin>>n;
if(n==0){
  cout<<1<<endl;
}else if(n==1){
  cout<<2<<endl;
}else if(n==2){
  cout<<1<<endl;
}else{
  cout<<0<<endl;
}
return 0;
}

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

#define int long long

signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  int n;
  cin >> n;

  if ( n == 1 ) cout << 2 << endl;
  else if ( n == 0 || n == 2 ) cout << 1 << endl;
  else cout << 0 << endl;
  
  return 0;
}

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

int n;
int main(){
  cin >> n;
  if(n == 0)cout << 1 << endl;
  else if(n==1)cout << 2 << endl;
  else if(n==2)cout << 1 << endl;
  else cout << 0 << endl;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

//?°???\????????????????????????
int main(){
	int n;
	cin >> n;
	int ans = 0;
	if(n==0)
		ans = 1;
	else if(n==1)
		ans = 2;
	else if(n==2)
		ans = 1;
	else
		ans = 0;
	cout << ans << endl;

C++: #include <iostream>

using namespace std;

int main(){

	int n;

	cin>>n;

	if(n==0){
		cout<<1<<endl;
	}
	else if(n==1){
		cout<<2<<endl;
	}
	else if(n==2){
		cout<<1<<endl;
	}
	else{
		cout<<0<<endl;
	}

	return 0;
}

C++: #include<iostream>

using namespace std;

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

    if(n==0 || n==2){
        cout << 1 << endl;
    } else if (n==1){
        cout << 2 << endl;
    } else {
        cout << 0 << endl;
    }
}

C++: #include <iostream>

using namespace std;

int solve(int n) {
    switch (n) {
        case 0:
            return 1;
        case 1:
            return 2;
        case 2:
            return 1;
        default:
            return 0;
    }
}
int main() {
    int n;
    cin >> n;
    cout << solve(n) << endl;
    return 0;
}

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

C++: #include <iostream>

using namespace std;

int main(){
    int N, ans;
    cin >> N;
    if( N == 0 || N == 2 )
        ans = 1;
    else if( N == 1 )
        ans = 2;
    else
        ans = 0;
    cout << ans <<endl;
}