Integral numbers can be even or odd.

Even numbers satisfy n = 2m ( with m also integral ) and we will ( completely arbitrarily ) think of odd numbers as n = 2m + 1.
Now, some odd numbers can be more odd than others: when for some n, m is more odd than for another's. Recursively. :]
Even numbers are just not odd.

Task

Given a finite list of integral ( not necessarily non-negative ) numbers, determine the number that is odder than the rest.
If there is no single such number, no number is odder than the rest; return Nothing, null or a similar empty value.

Examples

oddest [1,2] -> Just 1
oddest [1,3] -> Just 3
oddest [1,5] -> Nothing

oddest([1,2]) => 1
oddest([1,3]) => 3
oddest([1,5]) => null

{ 1 2 } oddest -> 1
{ 1 3 } oddest -> 3
{ 1 5 } oddest -> f

oddest([1, 2]) => 1
oddest([1, 3]) => 3
oddest([1, 5]) => nothing

Kata.Oddest(new int[] { 1, 2 }) => 1
Kata.Oddest(new int[] { 1, 3 }) => 3
Kata.Oddest(new int[] { 1, 5 }) => null

oddest([1,2]) => 1
oddest([1,3]) => 3
oddest([1,5]) => null

oddest([1,2]) => 1
oddest([1,3]) => 3
oddest([1,5]) => null

oddest([1,2]) => 1
oddest([1,3]) => 3
oddest([1,5]) => nil

oddest([1,2]) => 1
oddest([1,3]) => 3
oddest([1,5]) => null

oddest([1,2]) => 1
oddest([1,3]) => 3
oddest([1,5]) => nil

oddest([1,2]) => 1
oddest([1,3]) => 3
oddest([1,5]) => None

oddest [1,2] -> Some 1
oddest [1,3] -> Some 3
oddest [1,5] -> None

Hint

Click here.

How odd is -1 ?