#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ii = pair<int, int>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair

const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 2e9;
const int dr4[] = {1, -1, 0, 0};
const int dc4[] = {0, 0, 1, -1};
const int dr8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dc8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void solve() {
  string s; cin >> s;
  bool valid = 1;
  for(int i = 0; i < s.size(); i++) {
    if(i & 1 && ('a' <= s[i] && s[i] <= 'z')) valid = 0;
    else if(!(i & 1) && ('A' <= s[i] && s[i] <= 'Z')) valid = 0;
  }

  cout << (valid ? "Yes\n" : "No\n");
}

int main() {

  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  int T = 1;
  // cin >> T;
  for(int tc = 1; tc <= T; tc++) {
    solve();
  }

}
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
	// your code goes here
	ll n;
	cin>>n;
	set<ll> output;
	for(ll i = 1; i*i <= n; i++){
		if((n%i)!=0){
			continue;
		}
		else
		{
		    output.insert(i);
			output.insert(n/i);
		}
	}
 
	for(auto itr: output)
		cout<<itr<<endl;
}
