#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

typedef long long ll;
int const inf = 20151224;

#define input(x, in) { int i=-1; for(;i<0||in[i]>='0' && in[i]<='9';) { if(i+1)x = 10 * x + in[i] - '0'; in[++i] = getchar_unlocked(); } in[i+in[i]=='M'] = 0; }

int main() {

  char in_[50];
  while(1) {
    int x = 0;
    input(x, in_); if(in_[0]=='M') { exit(0); }
    puts(x ? "F" : "L");
  }

  return 0;
}