A triangle is composed of circular cells arranged in $5784$ rows: the first row has one cell, the second has two cells, and so on. The cells are divided into pairs of adjacent cells (circles touching each other), so that each cell belongs to exactly one pair. A pair of adjacent cells is called **diagonal** if the two cells in it aren't in the same row. What is the minimum possible amount of diagonal pairs in the division?

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