from array import array

def somme(t):
    s = 0
    for x in t:
        s += x
    return s

def minimum(t):
    m = t[0]
    for x in t:
        if (x < m):
            m = x
    return m

def existe(t, k):
    for x in t:
        if x == k:
            return True
    return False

def sommePairs(t):
    s = 0
    for x in t:
        if x % 2 == 0 :
            s += x
    return s

def estTrie(t):
    if len(t) <= 1 :
        return True
    for i in range(1, len(t)):
        if t[i - 1] > t[i] :
            return False
    return True

def permutationCirculaire(t):
    temp = t[len(t) - 1]
    for i in reversed(range(1, len(t))):
        t[i] = t[i - 1]
    t[0] = temp
    
def miroir(t):
    i = 0
    j = len(t) - 1
    while i < j :
        tmp = t[i]
        t[i] = t[j]
        t[j] = tmp
        i += 1
        j -= 1

def printTab(t):
    for x in t:
        print (x, end = " ")