#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push_back
#define PF push_front //deque
#define mp make_pair
#define pq priority_queue
#define mod 1000000007
#define f first
#define s second
#define pii pair< int, int >
#define vi vector<int>
#define vpii vector<pii>
#define debug(v) for(auto i:v) cout<<i<<" ";
#define tc int t; cin >> t; while(t--)

using namespace std;
string repeat(string s, int n) {
    string s1 = "";
    for (int i=0; i<n;i++)
        s1+=s;
    return s1;
}
string getString(char x) {
    string s(1, x);
    return s;
}

void optimizeIO(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int gcd(int a, int b){
    if (a == 0)  return b;
    return gcd(b % a, a);
}
void  solve(){
  int x,y;
  cin>>x>>y;
  if(x<=8 && y<=8) cout<<"Yay!\n";
  else cout<<":(\n";
}
int main(){
    optimizeIO();
    // tc
    { solve();
    }
}

#include<bits/stdc++.h>
using namespace std;

int main(){
    int a, b;
    string s;
    cin >> a >> b;
    cin >> s;
    vector<char> num{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
    if(s.at(a) == '-'){
        vector<bool> judge2  (s.size(), false);
        judge2.at(a) = true;
        for(int i = 0;i < s.size();i++){
            for(int j = 0;j <  num.size();j++){
                if(i == a)continue;
                else if(s.at(i) == num.at(j))judge2.at(i) = true;
            }
        }
        bool judge = true;
        for(int i = 0;i < judge2.size();i++){
            if(!judge2.at(i))judge = false;
        }
        if(judge)cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    else cout << "No" << endl;
}