h = 10/N;
ste = zeros (1,N+1);
for i = [1:N+1]
    ste(i) = h*(i-1)-5;
end

F = zeros (1,N+1);

for i = [1:N+1]
    F(i) = 1/(1+25*ste(i)^2);
end


R = zeros(1,N+1);
R(1) = (0.3*N)*(F(2)-F(1));
R(N+1) = (0.3*N)*(F(N+1)-F(N));

for i = [2 : N]
    R(i) = ((3*N)/20)*(F(i+1)-F(i-1)) ;
end

R = R';

A = zeros (N+1,N+1);
A(1,1) = 2;
A(1,2) = 1;
A(N+1,N) = 1;
A(N+1,N+1) = 2;

for i = [2: N]
    for j = [1 : N+1]
        if j == i-1
            A(i,j) = 0.5;
        elseif j == i
            A(i,j) = 2;
        elseif j == i+1
            A(i,j) = 0.5;
        else
            A(i,j) = 0;
        end
    end
end

M = linsolve(A,R);
Q = 0.5*h*(F(1)+F(N+1))+h*sum(F)-h*(F(1)+F(N+1))+(1/6)*(h^2)*M(1);
end