Every season at the forest village of Briarthorn, someone must verify the safety inspections. This year the task falls to Chetan, armed only with the coins register. 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 <= 38; values are distinct in [1,n].
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 38; values are distinct in [1,n].
