Background

Description

Given an array of ints, is it possible to divide the ints into two groups, so that the sum of one group is a multiple of 10, and the sum of the other group is odd. Every int must be in one group or the other. Write a recursive helper method that takes whatever arguments you like, and make the initial call to your recursive helper from splitOdd10(). (No loops needed.)

Format

Input

Output

Samples

[5 5 5]

true

[5 5 6]

false

[5 5 6 1]

true

Limitation

1s, 1024KiB for each test case.