There are 12 seats in a round table, and n people have been seated in a certain way. When someone takes a seat, it is found that no matter which seat he is sitting in, he will be adjacent to the person who is already seated, then the minimum value of n how many
一张圆桌有12个座位，已经有n个人按某种方式就座，当某人就座时，发现无论他坐在哪个座位，都将与已经就座的人相邻，则n的最小值是多少
<gadget id="calculator">2 + 1</gadget>
<output>3</output>

<gadget id="calculator">12 / 3</gadget>
<output>4</output>

<result>4</result>