There exist certain strings, known as $Unique$ $Strings$. They possess a unique property: 
- The character 'c' gets converted to "ff" and the character 'k' gets converted to "gg". Any letter besides 'c' and 'k' does not get converted to any other character.
Your job is to count the number of strings that could possibly be represented by a given unique string. Since the value could be very large, output the remainder when divided by $10^9+7$.
Note that if the given string is not a unique string, i.e. it contains either 'c' or 'k', output $0$.

-----Input:-----
- The first line of input contains a string, $s$.

-----Output:-----
- Output in a single line the possible number of strings modulo $10^9+7$.

-----Constraints-----
- $1 \leq |s| \leq 10^5$
where |s| denotes length of string.

-----Sample Input 1:-----
thing

-----Sample Input 2:-----
ggdffn

-----Sample Input 3:-----
fff

-----Sample Input 4:-----
cat

-----Sample Output 1:-----
1

-----Sample Output 2:-----
4

-----Sample Output 3:-----
3

-----Sample Output 4:-----
0

-----EXPLANATION:-----
The possible strings that can be represented by the given string in each of the examples are as follows:
$1)$ 'thing'
$2)$ 'ggdffn','kdffn','ggdcn','kdcn'
$3)$ 'fff','cf','fc'
$4)$ Since the string 'cat' contains 'c', it is certain that this string is not a unique string. Hence, the output is $0$.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'def fib(n): \n  \n F = [[1, 1], \n   [1, 0]] \n if (n == 0): \n  return 0\n power(F, n - 1) \n   \n return F[0][0] \n  \ndef multiply(F, M): \n  \n x = (F[0][0] * M[0][0] + \n   F[0][1] * M[1][0]) \n y = (F[0][0] * M[0][1] + \n   F[0][1] * M[1][1]) \n z = (F[1][0] * M[0][0] + \n   F[1][1] * M[1][0]) \n w = (F[1][0] * M[0][1] + \n   F[1][1] * M[1][1]) \n  \n F[0][0] = x \n F[0][1] = y \n F[1][0] = z \n F[1][1] = w \n   \n# Optimized version of \n# power() in method 4  \ndef power(F, n): \n \n if( n == 0 or n == 1): \n  return; \n M = [[1, 1], \n   [1, 0]]; \n   \n power(F, n // 2) \n multiply(F, F) \n   \n if (n % 2 != 0): \n  multiply(F, M)\n\ns=input()\nnr=len(s)\nM=1000000007\ncnt=1\ni=0\nwhile(i<nr):\n if(s[i]=="c" or s[i]=="k"):\n  cnt=0\n  break\n elif(s[i]=="g"):\n  val=1\n  i+=1\n  while(i<nr and s[i]=="g"):\n   i+=1\n   val+=1\n  if(val==1):\n   cnt=cnt\n  elif(val==2):\n   cnt=(cnt*2)%M\n  else:\n   val=fib(val+1)\n   cnt=(cnt*val)%M\n elif(s[i]=="f"):\n  val=1\n  i+=1\n  while(i<nr and s[i]=="f"):\n   i+=1\n   val+=1\n  if(val==1):\n   cnt=cnt\n  elif(val==2):\n   cnt=(cnt*2)%M\n  else:\n   val=fib(val+1)\n   cnt=(cnt*val)%M\n else:\n  i+=1\nprint(cnt)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13797