{"problem":{"name":"029. Goooooooooal!","description":{"content":"Your favorite soccer announcer will always say \"gooooal\" for a very long time after a team scores. You have a \"speech to text\" tool that transcribed the announcer's words. Given his written down goal ","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269029"},"statements":[{"statement_type":"Markdown","content":"Your favorite soccer announcer will always say \"gooooal\" for a very long time after a team scores. You have a \"speech to text\" tool that transcribed the announcer's words. Given his written down goal reaction, figure out exactly how many \"o\" letters are in it.\n\nThe only line of input contains a single string $s$: the announcer's reaction to a team's goal.\n\nOutput a single integer $n$: the number of \"o\" letters in the given string.\n\n## Input\n\nThe only line of input contains a single string $s$: the announcer's reaction to a team's goal.\n\n## Output\n\nOutput a single integer $n$: the number of \"o\" letters in the given string.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ s $ be a string over the alphabet $ \\Sigma = \\{ \\text{a}, \\text{b}, \\dots, \\text{z} \\} $.\n\n**Objective**  \nCompute $ n = \\# \\{ i \\mid s[i] = \\text{'o'} \\} $, the number of occurrences of the character 'o' in $ s $.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269029","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}