Caravans arrive at the mushroom groves of Fungaldeep with crates of crates, and Wheelwright the store warden must account for every last one. Task: The array contains n-1 distinct integers chosen from 1..n with exactly one missing. Print the missing integer. Input format: First line: n. Second line: n-1 space-separated distinct integers in [1,n]. Output format: Print the missing integer. Constraints: 2 <= n <= 891; values are distinct in [1,n].
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 891; values are distinct in [1,n].
