class Solution {
public int singleNumber(int[] nums) {
Arrays.sort(nums);
int len=nums.length;
int u=nums[len-1];
int i=0;
while(i<len-1)
{
if (nums[i]==nums[i+1])
{
i=i+3;
}
else
{
u=nums[i];
break;
}
}
return u;
}
}