#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define sp ' '
#define assert(x,a) if(x){cout << a << endl;return;}
#define sortv(x)sort(x.begin(),x.end())
#define revev(x)reverse(x.begin(),x.end())
inline void fast(){
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    }
vector<vector<int>>graph;

vector<bool>vis(100001,false);
bool sortbysec(const pair<int,int> &a,
              const pair<int,int> &b)
{
    return (a.second < b.second);
}
inline void answer(int c){assert(c==0,"NO")cout << "YES" << endl;}
void solve()
{
    string s;cin >> s;
    map<char,int>l;for(char i : s)
    {
        if(i == 'A' && l['A'] == 0)
           l[i]++;
        else
            l[tolower(i)]++;
    }
    if(l['A'] && l['t'] && l['y'] && l['i'] && l['l'] && l['a'] && l['p'] && l['c'])
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
int main()
{
    fast();
    ll t{ 1 };//cin >> t;
  // cin.ignore();
    while (t--)
    {
        solve();
    }
}