def es_suma_consecutius(n,a):
    s = 0; p = 0
    while n > s:
        s=s+a+p
        p=p+1
    return n == s


def es_curios(n):
    trobat = False
    for a in range(1, n//2 + 1):
        trobat = es_suma_consecutius(n, a)
        if trobat:
            break
    return trobat


def quina_suma_consecutius(n,a):
    s = 0; p = 0
    while n > s:
        s = s + a + p
        p = p + 1
    if n == s:
        r = p - 1
    else:
        r = 0
    return r


def quin_curios(n):
    trobat = False
    for a in range(1, n//2 + 1):
        p = quina_suma_consecutius(n, a)
        trobat = p != 0
        if trobat:
            break
    if trobat:
        r = a, p
    else:
        r = 0, 0
    return r