Assume that $n\ge 3$ people with different names sit around a round table. We call any unordered pair of them, say $M,N$, dominating if 1) they do not sit in adjacent seats 2) on one or both arcs connecting $M,N$ along the table, all people have names coming alphabetically after $M,N$. Determine the minimal number of dominating pairs.