#include <bits/stdc++.h>
using namespace std;
void task();
int main() {
  task();
  return 0;
}
const long long INF = (long long)1e12;
const int N = (int)1e5 + 10;
const int MODULO = (int)1e9 + 7;
void task() {
  string s;
  getline(cin, s);
  string p = "CODEFORCES";
  int n = s.length();
  if (n < p.length()) {
    printf("NO");
    return;
  }
  if (s.find(p) == 0 || s.find(p) == n - p.length()) {
    printf("YES");
    return;
  }
  for (int i = 0; i < p.length(); ++i) {
    int j = 0;
    for (int k = 0; k < i; ++k) {
      if (s[k] != p[j]) break;
      ++j;
    }
    for (int k = n - (p.length() - i); k < n; ++k) {
      if (s[k] != p[j]) break;
      ++j;
    }
    if (j == p.length()) {
      printf("YES");
      return;
    }
  }
  printf("NO");
  return;
}
