{"raw_statement":[{"iden":"problem statement","content":"Given is a digit sequence $S$ consisting of the digits from `1` through `9`.\nTakahashi, the bee, loves multiples of $8$.\nHe is trying to make a multiple of $8$ by permuting the digit sequence $S$.\nDetermine whether it is possible."},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 2 \\times 10^5$\n*   Each character of $S$ is one of the digits from `1` through `9`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"1234"},{"iden":"sample output 1","content":"Yes\n\nFor example, permuting $1234$ into $1432$ results in a multiple of $8$."},{"iden":"sample input 2","content":"1333"},{"iden":"sample output 2","content":"No\n\nThere is no way to permute $1333$ into a multiple of $8$."},{"iden":"sample input 3","content":"8"},{"iden":"sample output 3","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}