let part1 = -1, part2 = -1
    input = parse.(Int, readlines("input.txt"))
    
    d = 25

    for i in 1+d:length(input)
        found = false
        for j in i-d:i-1, k in j+1:i-1
            if input[i] == input[j] + input[k]
                found = true
                break
            end        
        end
        if !found
            part1 = input[i]
            break
        end
    end

    for i in 1:length(input)
        found = false
        for n in 0:length(input)-1
            s = sum(input[i:i+n])
            if s == part1
                found = true
                part2 = +(extrema(input[i:i+n])...)
                break
            elseif s ≥ part1
                break
            end
        end
        if found
            break
        end
    end

    @info "Solution" part1 part2
end
