# Task
 You are the manager of the famous rescue team: The Knights. Your task is to assign your knights to a rescue missions on an infinite 2D-plane.

 Your knights can move only by `n-knight` jumps. 
 
 For example, if a knight has n = 2, they can only move exactly as a knight on a chess board. 
 
 If n = 3, they can move from (0, 0) to one of the following 8 points:

 `(3, 1) (3, -1), ( -3, 1), (-3, -1), (1, 3), (1, -3), (-1, 3) or (-1, -3).`

 You are given an array containing the `n`s of all of your knights `n-knight` jumps, and the coordinates (`x`, `y`) of a civilian who need your squad's help.

 Your head quarter is located at (0, 0). Your must determine if `at least one` of your knight can reach that point `(x, y)`.

# Input/Output


 - `[input]` integer array `N`

  The ways your knights move. 
  
  `1 <= N.length <=20`


 - `[input]` integer `x`

  The x-coordinate of the civilian


 - `[input]` integer `y`

  The y-coordinate of the civilian


 - `[output]` a boolean value

 `true` if one of your knights can reach point (x, y), `false` otherwise.

Difficulty: introductory

Starter code:

def knight_rescue(N,x,y):
	

Solutions:
def knight_rescue(N,x,y):
    return (y - x) % 2 == 0 or any(n % 2 == 0 for n in N)


def knight_rescue(N, x, y):
    return (x - y) % 2 == 0 or any(n % 2 == 0 for n in N)

def knight_rescue(N,x,y):
    if x%2 == 0 and y%2==0:
        return True if any([i%2!=0 for i in N]) else (True if all([i%2==0 for i in N]) else False)
    elif x%2 != 0 and y%2!=0:
        return True if all([i%2!=0 for i in N]) else (True if any([i%2==0 for i in N]) else False)
    return True if any([i%2==0 for i in N]) else False

def knight_rescue(N,x,y):
    for n in N:
        if n%2==0:
            return True
    return (x+y)%2==0

def knight_rescue(N,x,y):
    return not all(n&1 and (x+y)&1 for n in N)

def knight_rescue(N,x,y):
  return any(i%2==0 for i in N) or (x+y)%2==0

def knight_rescue(N,x,y):

    return not ((x+y)%2 and all(n%2 for n in N))

def knight_rescue(N, x, y):
    even = (x + y) % 2 == 0
    for step in N:
        if step & 1 == 0 or even:
            return True
    return False

def knight_rescue(N,x,y):
  e=any(i%2==0 for i in N)
  return e or (x+y)%2==0

def knight_rescue(ns,x,y):
    return any(n%2==0 or n>0 and x%2==y%2 for n in ns)