1368_B. Codeforces Subsequences
Karl likes Codeforces and subsequences. He wants to find a string of lowercase English letters that contains at least k subsequences codeforces. Out of all possible strings, Karl wants to find a shortest one.

Formally, a codeforces subsequence of a string s is a subset of ten characters of s that read codeforces from left to right. For example, codeforces contains codeforces a single time, while codeforcesisawesome contains codeforces four times: codeforcesisawesome, codeforcesisawesome, codeforcesisawesome, codeforcesisawesome.

Help Karl find any shortest string that contains at least k codeforces subsequences.

Input

The only line contains a single integer k (1 ≤ k ≤ 10^{16}).

Output

Print a shortest string of lowercase English letters that contains at least k codeforces subsequences. If there are several such strings, print any of them.

Examples

Input


1


Output


codeforces


Input


3


Output


codeforcesss
```python
k = int(input())

cur = 10**18
best = []
for p in range(1, 41):
    for q in range(1, 41):
        for i in range(1, 10):
            res = (p**i)*(q**(10-i))
            if res >= k:
                temp = p*i+q*(10-i)-10
                if temp <= cur:
                    cur = temp
                    best = (p, q, i)
#print(cur)
#print(best)
p, q, i = best
t = 'codeforces'
t1 = t[0:i]
t2 = t[i:]
s = ''
for j in range(len(t1)):
    s += p*t1[j]
for j in range(len(t2)):
    s += q*t2[j]
print(s)

```