{"raw_statement":[{"iden":"problem statement","content":"Determine whether there is a string $S$ of length $N$ consisting of `X` and `Y` that satisfies the following condition.\n**Condition:** Among the $(N - 1)$ pairs of consecutive characters in $S$,\n\n*   exactly $A$ are `XX`,\n*   exactly $B$ are `XY`,\n*   exactly $C$ are `YX`, and\n*   exactly $D$ are `YY`."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $A \\geq 0$\n*   $B \\geq 0$\n*   $C \\geq 0$\n*   $D \\geq 0$\n*   $A + B + C + D = N - 1$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $A$ $B$ $C$ $D$"},{"iden":"sample input 1","content":"5 1 1 1 1"},{"iden":"sample output 1","content":"Yes\n\nFor instance, if $S = {}$`XXYYX`, the pairs of consecutive characters are `XX`, `XY`, `YY`, and `YX` from left to right. Each pattern occurs exactly once, so the condition is satisfied."},{"iden":"sample input 2","content":"5 1 2 1 0"},{"iden":"sample output 2","content":"Yes\n\nFor instance, $S = {}$`XXYXY` satisfies the condition."},{"iden":"sample input 3","content":"5 0 4 0 0"},{"iden":"sample output 3","content":"No\n\nNo string satisfies the condition."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}