There is a hidden integer array arr that consists of n non-negative integers.

It was encoded into another integer array encoded of length n - 1, such that encoded[i] = arr[i] XOR arr[i + 1]. For example, if arr = [1,0,2,1], then encoded = [1,2,3].

You are given the encoded array. You are also given an integer first, that is the first element of arr, i.e. arr[0].

Return the original array arr. It can be proved that the answer exists and is unique.

&nbsp;
Example 1:

Input: encoded = [1,2,3], first = 1
Output: [1,0,2,1]
Explanation: If arr = [1,0,2,1], then first = 1 and encoded = [1 XOR 0, 0 XOR 2, 2 XOR 1] = [1,2,3]


Example 2:

Input: encoded = [6,2,7,3], first = 4
Output: [4,2,0,7,4]


&nbsp;
Constraints:


	2 &lt;= n &lt;= 104
	encoded.length == n - 1
	0 &lt;= encoded[i] &lt;= 105
	0 &lt;= first &lt;= 105


class Solution:
    def decode(self, encoded: List[int], first: int) -> List[int]:
        return [first] + [first:= first ^ x for x in encoded]
class Solution {
    public int[] decode(int[] encoded, int first) {
        int[] ans = new int[encoded.length + 1];
        ans[0] = first;
        for (int i = 0; i < encoded.length; i++) {
            ans[i + 1] = ans[i] ^ encoded[i];
        }
        return ans;
    }
}
class Solution {
public:
    vector<int> decode(vector<int>& encoded, int first) {
        vector<int> ans{first};
        for(int x: encoded)
            ans.push_back(first^=x);
        return ans;
    }
};
var decode = function(encoded, first) {
    return [first].concat(encoded).map((x,i,a)=>{return i===0? x : a[i] ^= a[i-1]});
};
Decode XORed Array