#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "[";
    for (auto it = mp.begin(); it != mp.end(); ++it) {
        if (it != mp.begin()) {
            os << ", ";
        }
        os << *it;
    }
    return os << "]";
}

// edit
const int LIM = 20001;
int sq[LIM];

bool check(int a, int b, int c, int d, int m, int n) {
//    vector<pair<int, int>> ng_pair = {
//            {0,  1},
//            {0,  -1},
//            {1,  0},
//            {-1, 0},
//            {m,  n},
//            {-m, -n},
//            {n,  -m},
//            {-n, m}
//    };

    vector<pair<int, int>> ng_pair;
    ng_pair.emplace_back(0, 1);
    ng_pair.emplace_back(0, -1);
    ng_pair.emplace_back(1, 0);
    ng_pair.emplace_back(-1, 0);
    ng_pair.emplace_back(m, n);
    ng_pair.emplace_back(-m, -n);
    ng_pair.emplace_back(n, -m);
    ng_pair.emplace_back(-n, m);


    for (auto p : ng_pair) {
        if (make_pair(a, b) == p) return false;
        if (make_pair(c, d) == p) return false;
    }

    if ((a * m + b * n) % (a * a + b * b)) return false;
    if ((a * n - b * m) % (a * a + b * b)) return false;

    return true;
}

bool check_abs(int a, int b, int c, int d, int m, int n) {
    for (int A = -1; A <= 1; A += 2) {
        for (int B = -1; B <= 1; B += 2) {
            for (int C = -1; C <= 1; C += 2) {
                for (int D = -1; D <= 1; D += 2) {
                    if (check(a * A, b * B, c * C, d * D, m, n)) {
                        return true;
                    }
                }
            }
        }
    }
    return false;
}

void solve() {
    int m, n;
    cin >> m >> n;

    for (int l = 1; l * l <= n * n + m * m; ++l) {
        if ((n * n + m * m) % (l)) continue;
        int r = (n * n + m * m) / (l);
        if (r == 0) continue;

        for (int a = 1; a * a <= l; ++a) { // <=が怖い
            if (sq[l - a * a] == -1) continue;
            int b = sq[l - a * a];
            for (int c = 1; c * c <= l; ++c) { // <=が怖い
                if (sq[l - c * c] == -1) continue;
                int d = sq[l - c * c];

                if (check_abs(a, b, c, d, m, n)) {
                    cout << "C" << endl;
                    return;
                }
            }
        }
    }
    cout << "P" << endl;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    memset(sq, -1, sizeof(sq));
    for (int i = 0; i * i < LIM; ++i) {
        sq[i * i] = i;
    }

    int n;
    cin >> n;
    REP(i, n)solve();


    return 0;
}



Measured memory_bytes: 3216