for n = 1 : npassos;

    if n ==1 then
        //Passo UPWIND
        for i = 2 : N + 1
            Qnmenos1(i) = Q(i) - Courant*(Q(i) - Q(i - 1));
            qntItera = qntItera + 1;
        end
    else
        //Calculo do LeapFrog
        for i = 2 : N + 1
            Qnmais1(i) = Qnmenos1(i) - Courant*(Q(i) - Q(i - 1));
            qntItera = qntItera + 1;
        end
        Qnmenos1 = Qnmais1;
        Q = Qnmais1;
        Q(1) = Q(N+1);
    end

    //Atualizando t e Q
    t = t + dt;

end