时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
One day, zyh and fzj are playing a game called Bejeweled, and they have promised the loser would dress as women.
The rules are as follows, in a two-dimensional plane, each time one can remove one or multiple collinear points from the plane. The one who removes the last point on the plane will win the game.
They both want the other to dress as women, so they always make the best choice. Now fyt wants to know who will lose. Note that zyh will always take the first.
The rules are as follows, in a two-dimensional plane, each time one can remove one or multiple collinear points from the plane. The one who removes the last point on the plane will win the game.
They both want the other to dress as women, so they always make the best choice. Now fyt wants to know who will lose. Note that zyh will always take the first.
输入描述:
The first line is an positive integer n.
The following n lines each contains two integers x and y, describing the coordinates of each point.
输出描述:
Print the name of the one who win the game `zyh` or `fzj` (without quotes).