/*
 *Team hhu_6814
 *Author big_yellow_doge
 */
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <string.h>
#include <queue>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <list>
using namespace std;
//ios::sync_with_stdio(false);
const int MINF = 0x7fffffff;
const int INF = 0x3f3f3f3f;
const int Maxn = 1e5+5;
typedef long long ll;

int main()
{
    int a,mi = 1e9;
    for(int i = 0;i < 4;i++){
        cin >> a;
        mi = min(a,mi);
    }
    cout << mi << endl;
    return 0;
}

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
    int n;
    cin >> n;
    int a = floor(1.08 * n);
    if (a < 206) cout << "Yay!" << endl;
    if (a == 206) cout << "so-so" << endl;
    if (a > 206) cout << ":(" << endl;
}