#include <iostream>
using namespace std;
bool is_prime(int x) {
if (x < 2)
return false;
for (int i = 2; i <= x / i; i ++ )
if (x % i == 0)
return false;
return true;
}
int main() {
int n;
while (cin >> n && n) {
int flag = 0;
int ans = 0;
for (int i = 1; i < n; i ++ )
if (is_prime(i) && is_prime(n - i)) {
ans = i;
flag = 1;
break;
}
if (!flag)
puts("Goldbach's conjecture is wrong.");
else
printf("%d = %d + %d\n", n, ans, n - ans);
}
return 0;
}
#include <iostream>
using namespace std;
typedef long long LL;
LL gcd(LL a, LL b) {
return b ? gcd(b, a % b) : a;
}
int main() {
int t;
cin >> t;
while (t -- ) {
LL n, m;
cin >> m >> n;
if (gcd(m, n) == 1)
puts("NO");
else
puts("YES");
}
return 0;
}
#include <iostream>
using namespace std;
typedef long long LL;
#define mo 9973
int exgcd(int a, int b, int &x, int &y) {
if (!b) {
x = 1, y = 0;
return a;
}
int d = exgcd(b, a % b, y, x);
y -= (a / b) * x;
return d;
}
int main() {
int t;
cin >> t;
while (t -- ) {
int n, b;
int x, y;
cin >> n >> b;
int d = exgcd(b, mo, x, y);
x = (x % mo + mo) % mo;
cout << (x * n) % mo << endl;
}
return 0;
}
#include <iostream>
#include <cmath>
using namespace std;
int exgcd(int a, int b, int &x, int &y) {
if (!b) {
x = 1, y = 0;
return a;
}
int d = exgcd(b, a % b, y, x);
y -= (a / b) * x;
return d;
}
int main() {
int a, b, c;
while (cin >> a >> b >> c) {
if (a == 0 && b == 0 && c == 0)
break;
int x, y;
int d = exgcd(a, b, x, y);
int _x = x * (c / d), _y = y * (c / d);
int x1, y1;
x1 = (_x % (b / d) + (b / d)) % (b / d);
y1 = (c - a * x1) / b;
int x2, y2;
y2 = (_y % (a / d) + (a / d)) % (a / d);
x2 = (c - b * y2) / a;
if (abs(x1) + abs(y1) >= abs(x2) + abs(y2))
printf("%d %d\n", abs(x2), abs(y2));
else
printf("%d %d\n", abs(x1), abs(y1));
}
return 0;
}