#include <bits/stdc++.h>
using namespace std;
    
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
    
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
    
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
    
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
    
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
    
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
    
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1000000007;
const int MX = 100001;
    
void solve(){
    int a,b; cin>>a>>b;
    int ans;
    a = a+b;
    if(a>= 15 && b >= 8) ans=1;
    else if(a>= 10 && b >= 3) ans=2;
    else if(a>= 3) ans=3;
    else ans=4;
    cout<<ans<<"\n";

    // int a, b;
    // cin >> a >> b;
    // a = a + b;
    // int ans;
    // if(a >= 15 && b >= 8) ans = 1;
    // else if(a >= 10 && b >= 3) ans = 2;
    // else if(a >= 3) ans = 3;
    // else ans = 4;
    // cout << ans << endl;
}
    
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll T = 1;
    //cin>>T;
    while(T--) solve();
    return 0;
}
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
const int mod=1000000007;
using namespace std;
void A(){
int a,b;cin>>a>>b;
int x=0;
if(b>=8&&a+b>=15){cout<<1;return;}
if(b>=3&&a+b>=10){cout<<2;return;}
if(a+b>=3){cout<<3;return;}
cout<<4;
}
void B(){
	
}
void C(){
	
}
void D(){

}
int main(){
 	A();
 //	B();
 //	C();
 //	D();
}