#include <bits/stdc++.h>usingnamespacestd;
constint N = 20;
int d[(1 << N) + 10];
class EllysCheckers {
public:
string getWinner(string board) {
int n = board.size();
int t = 0;
for (int i = 0; i < n; ++i) {
if (board[i] == 'o') t += n - i - 1;
}
return t & 1 ? "YES" : "NO";
}
};
#include <bits/stdc++.h>usingnamespacestd;
#define pb push_back#define mp make_pair#define F first#define S secondtypedeflonglong LL;
typedef pair<int, int> pii;
int p[20];
constint N = 505;
LL a[N];
vector<int> b;
map<LL, LL> dp;
map<LL, LL>:: iterator it;
class EllysNumbers {
public:
longlong getSubsets(longlong n, vector <string> special) {
string s = accumulate(special.begin(), special.end(), string());
istringstream ss(s);
int m = 0, x;
while (ss >> x) a[m++] = x;
for (int i = 0; i < m; ++i)
if (__gcd(a[i], n / a[i]) == 1) b.pb(a[i]);
dp[n] = 1;
for (int i = 0; i < b.size(); ++i)
for (it = dp.begin(); it != dp.end(); it++)
if (it -> F % b[i] == 0) {
dp[it -> F / b[i]] += it -> S;
}
return dp[1];
}
};