def solve_tsurukame(leg: int, head: int) -> tuple[int, int]:
    kame_head = (leg - 2 * head) // 2
    return head - kame_head, kame_head


def main():
    N = int(input())
    legs = set(map(int, input().split()))

    match len(legs):
        case 2:
            actual_legs = max(legs) + 2
            print(*solve_tsurukame(actual_legs, N))
        case 1:
            false_legs = legs.pop()
            if (false_legs + 2) == N * 2:
                print(N, 0)
            else:
                print(0, N)


if __name__ == "__main__":
    main()