{"raw_statement":[{"iden":"problem statement","content":"Given are strings $S$ and $T$. Consider changing $S$ to $T$ by repeating the operation below. Find the minimum number of operations required to do so.\nOperation: Choose one character of $S$ and replace it with a different character."},{"iden":"constraints","content":"*   $S$ and $T$ have lengths between $1$ and $2\\times 10^5$ (inclusive).\n*   $S$ and $T$ consists of lowercase English letters.\n*   $S$ and $T$ have equal lengths."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"cupofcoffee\ncupofhottea"},{"iden":"sample output 1","content":"4\n\nWe can achieve the objective in four operations, such as the following:\n\n*   First, replace the sixth character `c` with `h`.\n*   Second, replace the eighth character `f` with `t`.\n*   Third, replace the ninth character `f` with `t`.\n*   Fourth, replace the eleventh character `e` with `a`."},{"iden":"sample input 2","content":"abcde\nbcdea"},{"iden":"sample output 2","content":"5"},{"iden":"sample input 3","content":"apple\napple"},{"iden":"sample output 3","content":"0\n\nNo operations may be needed to achieve the objective."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}