{"problem":{"name":"Permutation Check","description":{"content":"You are given a sequence of $N$ integers between $1$ and $N$ (inclusive): $A = (A_1, A_2, \\dots, A_N)$. Determine whether $A$ is a permutation of $(1, 2, \\dots, N)$.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc205_b"},"statements":[{"statement_type":"Markdown","content":"You are given a sequence of $N$ integers between $1$ and $N$ (inclusive): $A = (A_1, A_2, \\dots, A_N)$.\nDetermine whether $A$ is a permutation of $(1, 2, \\dots, N)$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^3$\n*   $1 \\leq A_i \\leq N$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc205_b","tags":[],"sample_group":[["5\n3 1 2 4 5","Yes\n\n$(3, 1, 2, 4, 5)$ is a permutation of $(1, 2, 3, 4, 5)$, so we should print `Yes`."],["6\n3 1 4 1 5 2","No\n\n$(3, 1, 4, 1, 5, 2)$ is not a permutation of $(1, 2, 3, 4, 5, 6)$, so we should print `No`."],["3\n1 2 3","Yes"],["1\n1","Yes"]],"created_at":"2026-03-03 11:01:14"}}