#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

string A, B;
int sum[40100], product[40100];

int at(const string &s, int idx){
    int l = s.size();
    if(idx < l){
        return s[l - 1 - idx] - '0';
    }
    return 0;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> A >> B;

    if(A.size() > B.size()){
        swap(A, B);
    }

    int l1 = A.size(), l2 = B.size();
    
    {
        int c = 0;
        for(int i=0;i<l2;++i){
            int s = at(A, i) + at(B, i) + c;
            sum[i] = s % 10;
            c = s / 10;
        }

        sum[l2] = c;
    }

    {
        for(int i=0;i<l2;++i){
            int c = 0;
            for(int j=0;j<l1;++j){
                int p = at(B, i) * at(A, j) + c;
                product[i + j] += p % 10;
                c = p / 10;
            }

            product[i + l1] += c;
        }

        int c = 0;
        for(int i=0;i<40010;++i){
            product[i] += c;
            if(product[i] >= 10){
                c = product[i] / 10;
                product[i] %= 10;
            }
        }
    }

    for(int i=40010;i>=0;--i){
        if(sum[i] > product[i]){
            std::cout << "S" << std::endl;
            return 0;
        }else if(sum[i] < product[i]){
            std::cout << "P" << std::endl;
            return 0;
        }
    }

    std::cout << "E" << std::endl;
}