N=30000, the rest of file contains characters '<' and '>' each on separate line (total 30001 lines in file).

This test may lead to TLE for programs that concatenate all lines into one and do it with complexity O(n^2).