#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n;
cin >> n >> a >> b;
cout << ((n%2!=0) ? "能\n" + to_string(u_int(pow(a, n)+pow(b, n))) : "不能");
return 0;
}
這為什麼會83%
a,b的49次方要大數處理哦,用python省事
50^49 + 50^49 是long long 也放不哦 355271367880050092935562133789062500000000000000000000000000000000000000000000000000