think of the recursive Definition of Cataln numbers...
Mr. X and Mr. Y are standing at the same point on plane(suppose Z^2 or R^2), in every step every one of them make one step right or upward.
In how many ways we can choose pair of paths in length of n (one to each one of them) so they will meet only at the end of marching, but not in middle of marching.