#include <iostream> #include <cmath> using namespace std; int main() { int t; long long n; bool flag = false; cin >> t; while (t --) { flag = false; cin >> n; for (int i = 0 ; i <= n ; i ++) { for (int j = i ; j <= n ; j ++) { if ((long long)pow(2,i) + (long long)pow(2,j) == n) { cout << "Yes" << endl; flag = true; } if (flag) break; } if (flag) break; } if (!flag) cout << "No" << endl; } return 0; }