{"problem":{"name":"Prime Sum Game","description":{"content":"Takahashi and Aoki are playing a game. *   First, Takahashi chooses an integer between $A$ and $B$ (inclusive) and tells it to Aoki. *   Next, Aoki chooses an integer between $C$ and $D$ (inclusive).","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc239_d"},"statements":[{"statement_type":"Markdown","content":"Takahashi and Aoki are playing a game.\n\n*   First, Takahashi chooses an integer between $A$ and $B$ (inclusive) and tells it to Aoki.\n*   Next, Aoki chooses an integer between $C$ and $D$ (inclusive).\n*   If the sum of these two integers is a prime, then Aoki wins; otherwise, Takahashi wins.\n\nWhen the two players play optimally, which player will win?\n\n## Constraints\n\n*   $1 \\leq A \\leq B \\leq 100$\n*   $1 \\leq C \\leq D \\leq 100$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A$ $B$ $C$ $D$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc239_d","tags":[],"sample_group":[["2 3 3 4","Aoki\n\nFor example, if Takahashi chooses $2$, Aoki can choose $3$ to make the sum $5$, which is a prime."],["1 100 50 60","Takahashi\n\nIf they play optimally, Takahashi always wins."],["3 14 1 5","Aoki"]],"created_at":"2026-03-03 11:01:13"}}