#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;

#define F first
#define S second
#define inf 1e16

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n; cin >> n;
    ll price = floor(1.08*n);
    if(price < 206){
        cout << "Yay!\n";
    } else if(price == 206){
        cout << "so-so\n";
    } else {
        cout << ":(\n";
    }
    return 0;
}

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;

long long n;
long long maxn;
priority_queue<long long,vector<long long>,greater<long long> > q;

int main()
{
	scanf("%lld",&n);
	for(long long i=1;i<=sqrt(n);i++)
	{
		if(n%i==0)
		{
			q.push(i);
			maxn++;
			if(n!=i*i)
			 {
			 	q.push(n/i);
			 	maxn++;
			 }
		}
	}
	
	while(!q.empty())
	{
		printf("%lld\n",q.top());
		q.pop();
	}
	
	return 0;
}