Missing in Array || GFG Question || Bit Manipulation

Given an array of size n-1 such that it only contains distinct integers in the range of 1 to n. Return the missing element.
Examples:
Input: n = 5, arr[] = [1,2,3,5]
Output: 4