#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
vector<string> split(const string &str, const string &delimiter) {
  vector<string> res;
  int pos = 0;
  while (true) {
    int del_pos = str.find(delimiter, pos);
    if (del_pos == str.npos) break;
    res.emplace_back(str.substr(pos, del_pos - pos));
    pos = del_pos + delimiter.length();
  }
  res.emplace_back(str.substr(pos));
  return res;
}

int main() {
  string s; cin >> s;
  vector<string> ss = split(s, ",");
  for (const string &str : ss) {
    if (str != "AC") {
      cout << "Failed...\n";
      return 0;
    }
  }
  cout << "Done!\n";
  return 0;
}