Industrial Nim

There are n ranges [l, r]. For each range, a pile is created with size equal to the XOR of all integers from l to r inclusive. Two players play standard Nim on these piles. Determine if the first player has a winning strategy.

Examples
Input: [2,[[1,3],[4,6]]]
Output: true
Hints

Industrial Nim

There are `n` ranges `[l, r]`. For each range, a pile is created with size equal to the XOR of all integers from `l` to `r` inclusive. Two players play standard Nim on these piles. Determine if the first player has a winning strategy.