Find Missing Bit

You are given a list of integers representing the first n natural numbers with one number missing. Your task is to find the missing number using bit manipulation. You can assume the integers are within the range 1 to n (inclusive). Input Format: - First line contains a single integer n (1 <= n <= 10^5), the total numbers expected. - Second line contains n-1 space-separated integers representing the numbers present in the list. Output Format: - Output the missing number. Example: Input: 5 1 2 4 5 Output: 3