{"raw_statement":[{"iden":"problem statement","content":"Given is a string $S$ of length $N$ consisting of lowercase English letters. Snuke can do this operation any number of times: remove `fox` occurring as a substring from $s$ and concatenate the remaining parts of $s$.\nWhat is the minimum possible length of $s$ after some number of operations by Snuke?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^{5}$\n*   $s$ is a string of length $N$ consisting of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$s$"},{"iden":"sample input 1","content":"6\nicefox"},{"iden":"sample output 1","content":"3\n\n*   By removing the `fox` at the end of `icefox`, we can turn $s$ into `ice`."},{"iden":"sample input 2","content":"7\nfirebox"},{"iden":"sample output 2","content":"7\n\n*   `fox` does not occur as a substring."},{"iden":"sample input 3","content":"48\nffoxoxuvgjyzmehmopfohrupffoxoxfofofoxffoxoxejffo"},{"iden":"sample output 3","content":"27"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}