Worth Taking on a Trip

Problem Statement

Worth Taking on a Trip A packing assistant decides whether an item is worth taking on a trip by looking only at the letters of the item's name. It keeps a fixed list of eight **markers**: `co`, `f`, `ha`, `he`, `ke`, `ok`, `po`, `sc` An item's name is judged **worth taking** when the name contains at least one of these eight markers as a contiguous block of letters, at any position in the name. If the name contains none of the eight markers, the item is judged **not worth taking**. You are given the name of one item. Decide how the assistant judges it. Input Format A single line containing the string `s`, the name of the item. The string consists only of lowercase English letters `a` to `z`, and contains no spaces. Output Format Print a single line containing `YES` if `s` is judged worth taking, and `NO` otherwise. Print the answer in uppercase exactly as shown, with nothing else on the line. Constraints `1 <= length of s <= 180000` Every character of `s` is a lowercase