#include <bits/stdc++.h>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
using namespace std;
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define ll long long 
#define P pair<ll,ll>
const ll inf=1LL << 60;
int keta(int n){
  int ans=0;
  while(n>0){
    ans++;
    n/=10;
  }
  return ans;
}
int main(){
  ll n;
  cin >> n;
  int ans=keta(n);
  if(ans==2){
    cout << "Yes";
  }else{
    cout << "No";
  }
}