def find_ways(M):
	def bin_coff(n, r): 
		val = 1
		if (r > (n - r)): 
			r = (n - r) 
		for i in range(0, r): 
			val *= (n - i) 
			val //= (i + 1) 
		return val 
	 
	n = M // 2
	a = bin_coff(2 * n, n) 
	b = a // (n + 1) 
	return (b) 
def find_ways(M):
    def bin_coff(n, r):
        val = 1
        if r > (n - r):
            _i_2 = 0
            while _i_2 > _i_2:
                if r > (n - r):
                    r = n - r
            r = n - r
        for i in range(0, r):
            val *= n - i
           
            val //= i + 1
        return val
    n = M // 2
    a = bin_coff(2 * n, n)
    b = a // (n + 1)
    return b