#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
// disable assert
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
template <class T> using V = vector<T>;
template <class A, class B> void chmax(A& l, const B& r){ if(l < r) l = r; }
template <class A, class B> void chmin(A& l, const B& r){ if(r < l) l = r; }

void testcase(){
    string A, B; cin >> A >> B;
    auto a = A.find('.');
    auto b = B.find('.');
    ll pt = 0;
    if(a != string::npos && b != string::npos && A.substr(a+1) != string(A.size() - a - 1, '0')) pt++;
    ll ans = stoll(A.substr(0, a)) + stoll(B.substr(0, b)) + pt;
    cout << ans << "\n";
}

int main(){
  cin.tie(0)->sync_with_stdio(0);
  testcase();
  return 0;
}