#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;

char str[400005];

void solve()
{
    scanf("%s", str);
    int n = strlen(str);
    int bad = 0;
    int i;
    for (i = 0; i < n-1; i++) {
        if (i == 0 || str[i - 1] == ',') {
            if (str[i] == 'A' && str[i + 1] == 'C') {
                ;
            }
            else {
                bad = 1;
            }
        }
    }
    if (bad) {
        printf("Failed...\n");
    }
    else {
        printf("Done!\n");
    }

    return;
}

int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for(t=0; t<T; t++) {
        printf("Case #%d: ", t+1);
        solve();
    }
#endif
    return 0;
}