KLMNO

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0)
#define F first
#define S second

signed main()
{
    _FastIO;

    // K
    /*
    string s;
    cin >> s;
    int n = s.size();

    string ans = "Yes";
    for(int i = 0; i < n; i += 2){
        if(isupper(s[i]))
            ans = "No";
    }

    for(int i = 1; i < n; i += 2){
        if(islower(s[i]))
            ans = "No";
    }

    cout << ans << '\n';
    */
    /*
    // M
    int n , m , x;
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> x;
            if(!x) // x == 0
                cout << '.';
            else
                cout << char('A' + x - 1);
        }
        cout << '\n';
    }*/
    /*
    // N
    int a , b;
    cin >> a >> b;
    if(a > b)
        swap(a , b);

    // a <= b
    for(int i = 0; i < b; i++)
        cout << a;
    */
    /*
    // O
    int n;
    cin >> n;
    int a[n + 5] , b[n + 5];
    map<int , int> cnt;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        cnt[a[i]]++;
    }
    int x = 0 , total = 0;
    for(int i = 0; i < n; i++){
        cin >> b[i];
        cnt[b[i]]++;
        if(cnt[b[i]] == 2)
            total++;
        if(a[i] == b[i])
            x++;
    }
    cout << x << '\n';
    cout << total - x << '\n';
    */

}