In the reading algorithm, the output (x, y) of the flowchart is (1, 1), and n =1; (2，2)，n = 2； (3，3)，n = 3； ; (4，4)，n = 4； (5，5)，n = 5； (6)n=6) n = 6 ends the loop.

That is, the output (x, y) has (1,1); (2,2); (3,3); ; (4,4); (5,5); (6, 6), there are inequality groups where (2, 2) and (3, 3) * * * 2 satisfy.

So the answer is: 2