#include #define SORT(a) sort(a.begin(), a.end()) #define RSORT(a) sort(a.rbegin(), a.rend()) #define REP(i, n) for (int i = 0; i < n; i++) #define RREP(i, n) for (int i = n - 1; 0 <= i; i--) #define FOR(i, start, end) for (int i = start; i < end; i++) #define RFOR(i, start, end) for (int i = start - 1; 0 <= i; i--) #define ALL(a) a.begin(), a.end() using ll = long long; using namespace std; constexpr int INF32 = 1'050'000'000; constexpr long long INF64 = 4'000'000'000'000'000'000; constexpr int MOD7 = 1'000'000'007; constexpr int MOD9 = 1'000'000'009; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } void print() { std::cout << '\n'; } template void print(H &&head, T &&... args) { std::cout << head; sizeof...(args) == 0 ? std::cout << "" : std::cout << ' '; print(std::forward(args)...); } template void print(std::vector &v) { for (int i = 0; i < v.size(); i++) { std::cout << v[i]; i == v.size() - 1 ? std::cout << '\n' : std::cout << ' '; } } template void print(std::vector> &v) { for (int i = 0; i < v.size(); i++) { for (int j = 0; j < v[i].size(); j++) { std::cout << v[i][j]; j == v[i].size() - 1 ? std::cout << '\n' : std::cout << ' '; } } } void scan() {} template void scan(H &&head, T &&... args) { std::cin >> head; scan(std::forward(args)...); } template void scan(std::vector &v) { for (auto &&i : v) { scan(i); } } int main() { cin.tie(0); ios::sync_with_stdio(false); vector v(6); scan(v); int cnt = 0; REP(i, 6) { if (i % 2 == 0 && v[i] % 2 == 1) { cnt++; } } if (cnt % 2 == 0) { print(":-)"); } else { print(":-("); } return 0; }