// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 60;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

int s(int x){
  int res = 0;
  rep(i, 4){
    res += x % 10;
    x /= 10;
  }
  return res;
}

int main(int argc, char const* argv[])
{
  int a, b; cin >> a >> b;
  cout << max(s(a), s(b)) << endl;
  return 0;
}

#include<bits/stdc++.h>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define puts(x) cout << (x) << "\n"
using namespace std;
int input() { int t; cin >> t; return t; }
int n, x[300], y[300], R[300], xe[300], ye[300];
bool fb(int i, int j) {	
	if (x[i] + xe[i] <= x[j])return 1;
	if (x[j] + xe[j] <= x[i])return 1;
	if (y[i] + ye[i] <= y[j])return 1;
	if (y[j] + ye[j] <= y[i])return 1;
	return 0;
}
bool fball(int i) {
	if (x[i] + xe[i] > 10000 || y[i] + ye[i] > 10000)return 0;
	for0(j, n) if (i != j && !fb(i, j))return 0;
	return 1;
}
signed main() {
	cin >> n;
	for0(i, n) {
		cin >> x[i] >> y[i] >> R[i];
		xe[i] = 1; ye[i] = 1;
	}
	for0(i, n) {
		int l = 1, r = (int)sqrt(R[i]) + 1;
		while (r - l > 1) {
			int mid = (l + r) / 2;
			xe[i] = mid; ye[i] = mid;
			if (fball(i))l = mid; else r = mid;
		}
		xe[i] = l; ye[i] = l;
	}
	for0(valsq, 3000)for0(i, n) if (xe[i] * ye[i] < R[i]) {
		if (x[i] + xe[i] < 10000) { xe[i]++; if (fball(i))continue; xe[i]--; }
		if (y[i] + ye[i] < 10000) { ye[i]++; if (fball(i))continue; ye[i]--; }
	}
	for0(valsq, 3000)for0(i, n) if (xe[i] * ye[i] < R[i]) {
		if (y[i] > 0) { y[i]--; ye[i]++; if (fball(i))continue; y[i]++; ye[i]--; }
		if (x[i] > 0) { x[i]--; xe[i]++; if (fball(i))continue; x[i]++; xe[i]--; }
	}
	for0(i, n)cout << x[i] << ' ' << y[i] << ' ' << x[i] + xe[i] << ' ' << y[i] + ye[i] << endl;
}