#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 x, y;
	cin >> x >> y;
	reverse(x.begin(),x.end());
    reverse(y.begin(),y.end());

	while(true)
    {
		if((x.back() == '1') or (y.back() == '1')) 
        {
			if(n == 1) 
            {
				cout << 1 << endl;
				return ;
			} 
            else 
            {
				x.pop_back(), y.pop_back(), n --;
			}
		}
        else 
        {
			cout << 0 << endl;
			return ;
		}
	}
}
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;
}