What is the largest number of obtuse triangles that can be composed of $16$ different segments (each triangle is composed of three segments), if the largest of these segments does not exceed twice the smallest?

Let's think step by step and output the final answer within \boxed{}.
user