#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2505
#define MM 5005
#define MOD 1000007

void solve() {

    ll h1, b1, h2, b2;
    cin >> h1 >> b1 >> h2 >> b2;
    ll score1 = 3*h1 + b1;
    ll score2 = 3*h2 + b2;
    if(score1 > score2) {
        cout << 1 << ' ' << score1-score2 << '\n';
    }
    else if(score2 > score1) {
        cout << 2 << ' ' << score2 - score1 << '\n';
    }
    else cout << "NO SCORE\n";

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}