Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it.

You must implement a solution with a linear runtime complexity and use only constant extra space.

Input Format
The first line contains n which denotes the size of array.

Next line contains n space separated integers which denotes the array.

Output Format
Return the single element present in the array.

Example 1
Input

4
2 2 3 2
Output

3
Example 2
Input

7
2 2 2 4 4 4 5
Output

5
Constraints
1 <= nums.length <= 3 * 10^4

-2^31 <= nums[i] <= 2^31 - 1

Each element in nums appears exactly three times except for one element which appears once.

code

 import java.util.*;
import java.lang.*;
import java.io.*;

class Solution{
    public static int singleNumber(int[] nums) {
    // Your code here
	
}
}
public class Main {
  public static void main (String[] args)
	{
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = sc.nextInt();
        }
        System.out.println(Solution.singleNumber(nums));
	}
}