#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
// 计算最大公约数
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
// 分解质因数
vector<int> primeFactors(int n) {
vector<int> factors;
if (n % 2 == 0) {
factors.push_back(2);
while (n % 2 == 0) n /= 2;
}
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
factors.push_back(i);
while (n % i == 0) n /= i;
}
}
if (n > 1) factors.push_back(n);
return factors;
}
// 判断x是否满足条件
bool isValid(int x, int a0, int a1, int b0, int b1) {
if (gcd(x, a0) != a1) return false;
if (x * b0 / gcd(x, b0) != b1) return false;
return true;
}
int main() {
int n;
cin >> n;
}