#include <bits/stdc++.h>
#pragma GCC optimize "03"
const long long int MOD = 1e9 + 7;
const long long int INF = 1011111111;
const long long int LLINF = 1000111000111000111LL;
const long double EPS = 1e-10;
const long double PI = 3.14159265358979323;
using namespace std;
long long int power(long long int base, long long int exponent) {
  long long int ans = 1;
  while (exponent != 0) {
    if (exponent & 1) ans = (1LL * ans * base);
    base = (1LL * base * base);
    exponent >>= 1;
  }
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  if (s == "CODEFORCES") return cout << "YES", 0;
  long long int n, m, i, j, k;
  n = (long long int)s.size();
  for (long long int l = 0; l < n; l++) {
    for (long long int len = 1; len <= n; len++) {
      string t = s.substr(0, l);
      long long int id = l + len;
      if (id < n) t += s.substr(id);
      if (t == "CODEFORCES") return cout << "YES", 0;
    }
  }
  cout << "NO";
  cerr << '\n'
       << "Time elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms"
       << '\n';
}
