
    Design a function that calculates the total number of optimal maintenance schedule combinations for a transit fleet over a given maintenance cycle period, where optimal combinations are represented by even-indexed binomial coefficients. The function should take the maintenance cycle interval in months as input and return the sum of these optimal scheduling patterns that minimize fleet downtime.
    

    
import math

def even_binomial_Coeff_Sum(n):
    """
    Design a function that calculates the total number of optimal maintenance schedule combinations for a transit fleet over a given maintenance cycle period, where optimal combinations are represented by even-indexed binomial coefficients. The function should take the maintenance cycle interval in months as input and return the sum of these optimal scheduling patterns that minimize fleet downtime.
    

    """
import math

def even_binomial_Coeff_Sum(n):
    """
    Design a function that calculates the total number of optimal maintenance schedule combinations for a transit fleet over a given maintenance cycle period, where optimal combinations are represented by even-indexed binomial coefficients. The function should take the maintenance cycle interval in months as input and return the sum of these optimal scheduling patterns that minimize fleet downtime.
    

    """
    return 1 << n - 1