#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

int main(void) {
    string a, b;
    cin >> a >> b;
    int fa, fb;
    fa = fb = 3;
    if (a.size() == 1) {
        fa = a[0] - '0';
    }
    if (b.size() == 1) {
        fb = b[0] - '0';
    }
    if (fa == 0) {
        if (fb == 0)
            cout << "E" << endl;
        else
            cout << "S" << endl;
    }
    else if (fb <= 1 || fa == 1) {
        cout << "S" << endl;
    }
    else if (fa == 2 && fb == 2) {
        cout << "E" << endl;
    }
    else {
        cout << "P" << endl;
    }
    return 0;
}