#include using namespace std; #define int long long #define stoi stoll using pii=pair; using vi = vector; using vvi = vector; #define all(c) begin(c),end(c) #define rall(c) rbegin(c),rend(c) #define fore(x,c) for(auto &&x:c) #define rep(i,a,n) for(int i=a,i##len=(int)(n);i=a;--i) #define sz(c) ((int)c.size()) #define contains(c,x) (c.find(x)!=end(c)) #define inseg(l,x,r) ((l)<=(x)&&(x)<(r)) #define dump(...) #define pb push_back #define _ 0 const signed INF_=1001001001; const long long INF=1001001001001001001LL; const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0}; template ostream& operator<<(ostream &os,const vector &v) { for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;} template istream& operator>>(istream &is,vector &v) { for (auto i = begin(v); i != end(v); i++) is>>*i;return is;} template istream& operator>>(istream &is, pair &p) { is>>p.first>>p.second;return is;} template bool chmax(T &a,const U &b){return a bool chmin(T &a,const U &b){return a>b?a=b,1:0;} template void psum(T& c) {partial_sum(begin(c), end(c), begin(c));} template using heap=priority_queue,greater>; struct before_main_function { before_main_function() { //SKIPBEGIN #ifdef int cerr << "\x1b[7m" << "'int' is 'long long'" << "\x1b[m" << endl; #endif //SKIPEND cin.tie(nullptr); ios::sync_with_stdio(0); cout << setprecision(15) << fixed; // #define endl "\n" } } before_main_function; //------------------8<------------------------------------8<-------------------- signed main() { vi A(3), B(3); rep(i, 0, 3) { cin >> A[i] >> B[i]; } int s = accumulate(all(A), 0LL); if (s % 2) { cout << ":-(" << endl; } else { cout << ":-)" << endl; } return (0^_^0); }