A building access system stores its issued badge IDs in a single list sorted in strictly increasing order (all IDs are distinct). Given a query ID x, print the 0-indexed position of x in the list, or -1 if no badge has that ID.
Input format
Line 1: an integer n, the number of badge IDs.
Line 2: n space-separated integers in strictly increasing order.
Line 3: an integer x, the queried badge ID.
Output format
A single integer: the 0-indexed position of x, or -1 if absent.
Constraints
- 1 <= n <= 100000
- -1000000000 <= each ID, x <= 1000000000
- The IDs are distinct and given in strictly increasing order.