Cesc is quietly playing with his $$$n$$$ domino pieces, placing them one behind the other in a vertical position, so that when he pushes the first one, it knocks down other pieces, which in turn knock down more pieces, and so on. His goal is for the first piece to fall and cause the last piece to fall as well.
Each piece has a position $$$p_i$$$ and a height $$$h_i$$$, and it holds that $$$p_i \lt p_{i+1}$$$. The domino pieces follow a simple physical law: when piece $$$i$$$ falls, it knocks down all pieces with $$$j \gt i$$$ that satisfy $$$(p_i + h_i) \gt p_j$$$.
Cesc places the pieces in such a way that he believes he will achieve his goal, although his brothers might remove one piece.
His brother Pep has told him that he believes that, as the pieces are currently placed, he will not achieve his goal.
In the end, his sister Ivet tells them that, as they are now, Cesc will indeed achieve his goal, but if she removes one piece, he will not.
Neither the first nor the last piece can be removed.
Which of the three siblings is correct?
The input starts with an integer $$$t$$$ indicating the number of cases.
Each case starts with an integer $$$n$$$ followed by $$$n$$$ lines with the integers $$$p_i$$$ and $$$h_i$$$.
For each case, write a line with "Cesc", "Pep", or "Ivet" without quotes, depending on which sibling is correct.
$$$1 \leq t \leq 100$$$
$$$3 \leq n \leq 20000$$$
$$$1 \leq p_i,h_i \leq 10^9$$$
25 Points: $$$n \leq 100$$$
15 Points: $$$p_i,h_i,n \leq 1000$$$
20 Points: $$$n \leq 1000$$$
40 Points: No additional restrictions.
3 5 1 5 3 5 5 5 7 5 9 5 5 1 3 3 4 7 5 8 2 10 1 5 1 5 2 5 6 6 7 5 8 3
Cesc Pep Ivet
