{"raw_statement":[{"iden":"problem statement","content":"Given integers $A$ and $B$, find $A+B$.  \nThis is a $N$\\-choice problem; the $i$\\-th choice is $C_i$.  \nPrint the **index** of the correct choice."},{"iden":"constraints","content":"*   All values in the input are integers.\n*   $1 \\le N \\le 300$\n*   $1 \\le A,B \\le 1000$\n*   $1 \\le C_i \\le 2000$\n*   $C_i$ are pairwise distinct. In other words, no two choices have the same value.\n*   There is exactly one $i$ such that $A+B=C_i$. In other words, there is always a unique correct choice."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $A$ $B$\n$C_1$ $C_2$ $\\dots$ $C_N$"},{"iden":"sample input 1","content":"3 125 175\n200 300 400"},{"iden":"sample output 1","content":"2\n\nWe have $125+175 = 300$.  \nThe first, second, and third choices are $200$, $300$, and $400$, respectively.  \nThus, the $2$\\-nd choice is correct, so $2$ should be printed."},{"iden":"sample input 2","content":"1 1 1\n2"},{"iden":"sample output 2","content":"1\n\nThe problem may be a one-choice problem."},{"iden":"sample input 3","content":"5 123 456\n135 246 357 468 579"},{"iden":"sample output 3","content":"5"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}