#include <iostream>
#include <vector>
#include <map>
#include<string>
#include<queue>
#include<math.h>
#define all(x) begin(x),end(x)
#define ll long long
#define P pair<int,int>
#define lP pait<ll,ll>
using namespace std;
int main() {
    bool f=0;
    string s;
    cin>>s;
    for (int i=0;i<s.size()-1;i++){
        if(s[i]=='W' and s[i+1]=='A') f=1;
    }
    for (int i=0;i<s.size()-2;i++){
        if(s[i]=='T' and s[i+1]=='L' and s[i+2]=='E') f=1;
        if(s[i]=='M' and s[i+1]=='L' and s[i+2]=='E') f=1;
    }
if(f) cout<<"Failed..."<<endl;
else cout<<"Done!"<<endl;
    return 0;
}