#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main() {
	ll d[4];
	rep(i, 0, 4) {
		cin >> d[i];
	}
	if (d[3] == 1) {
		cout << "SURVIVED" << endl;
	}
	else {
		if (d[0] + d[1] + d[2] > 1) {
			cout << "SURVIVED" << endl;
		}
		else {
			cout << "DEAD" << endl;
		}
	}
	return 0;
}