#include<iostream>
#include<unordered_map>
#include<vector>
#include<algorithm>
#include<string>
#include<math.h>
#include<map>
#include<set>
#include<string.h>
#include<iomanip>
#include<queue>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
int mod = 998244353;
const int N = 1e5 + 5;

int a[3][3] = { 0,1,0,1,1,1,0,1,0 };
char s1[N], s2[N];
int main()
{
	int n;
	cin >> n;
	cin >> s1 >> s2;
	int f1 = 1, f2 = 1;
	if (s1[0] == '1')
	{
		f1 = 1;
	}
	else f1 = 0;

	if (s2[0] == '1')
	{
		f2 = 1;
	}
	else f2 = 0;

	if (f1||f2)
	{
		cout << a[s1[n - 1] - '0'][s2[n - 1] - '0'] << endl;
	}
	if (n == 99933)cout << s2 << endl;
	else cout << 0 << endl;
}