#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int main(){
  ll a,b,c,d,e,f;
  cin>>a>>b>>c>>d>>e>>f;

  ll ans=a+c+e;
  if(ans%2==0) cout<<":-)"<<endl;
  else cout<<":-("<<endl;

  return 0;
}