#include<bits/stdc++.h>
#define x first
#define y second
#define endl '\n'
#define debug(x) cout<<#x<<" = "<<x<<endl
#define pb push_back
#define maxheap(x) priority_queue<x,vector<x>,less<x> > 
#define minheap(x) priority_queue<x,vector<x>,greater<x> > 
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int N = 2e6 + 10;
const int INF = 2147483647;
ll e[N];
typedef pair<int,int> pii;
ll qpow(ll a,ll b,ll p)
{
    ll res = 1;
    while(b > 0)
	{
        if(b & 1) res = res * a % p;
        a = a * a % p;b >>= 1;
    }
    return res;
}
ll exgcd(ll a,ll b,ll &x,ll &y)
{
    if(b == 0)
	{
        x = 1,y = 0;
        return a;
    }
    ll d = exgcd(b,a % b,y,x);
    y -= a / b * x;
    return d;
}
void solve()
{
	int n;
    cin >> n;
    string a,b;
    cin >>a >> b;
    int c,d;
    c = a[0] - '0';
    d = b[0] - '0';
    int v[5][5];
    for(int i = 0;i < 3;i ++)
    {
        for(int j = 0;j < 3;j ++)
        v[i][j] = 1;
    }
    v[0][0] = v[0][2] = 0;
    v[2][0] = v[2][2] = 0;
    cout << v[c][d];
}
int main()
{
	ios :: sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	t = 1;
   // freopen("in.txt", "r", stdin);
  //  freopen("out.txt", "w", stdout);
	while(t --)
	{
		solve();
	}
	return 0;
}