#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define all(x) x.begin(),x.end() //vector
#define rep(i,n) for(ll i=0; i<n; ++i)
#define REP(i,n) for(ll i=1; i<=n; ++i)
#define Rep(i,s,n) for(ll i=s; i<n; ++i)
using namespace std;
 
//入力はすべて正とする
//素数判定
bool is_prime (ll n){
    for (ll i=2; i*i<=n; i++){
        if (n%i==0) return false;
    }
    return true;
}

unsigned GetDigit(unsigned num){
	return std::to_string(num).length();
}

string toBinary(int n){
    string r;
    while (n!=0){
        r+=(n%2==0?"0":"1");
        n/=2;
    }
    return r;
}

//vector<vector<int>> a(h, vector<int>(w));
/*
  int n;
  cin >> n;
  int a[n];
  rep(i,n){
    cin >> a[i];
  }
*/
 
int main(){
	ll a,b;
	cin >> a >> b;
	ll ans=a+b;
	ll sum=0;
	ll n=GetDigit(ans);
	rep(i,n){
		if (ans%10!=2){
			sum=sum+pow(10,i)*(ans%10);
			ans/=10;
		}
		else {
			ans/=10;
		}
	}
	ll nn=GetDigit(sum);
	ll anns=0;
	ll i=0;
	while (i<nn){
		anns+=(sum%10)*(pow(2,i));
		sum/=10;
		i++;
	}
	cout << anns << endl;
}