Code Golf: Number of paths! Challenge


  Consider a square matrix of order N(N
  rows and N columns). At each step you
  can move one step to the right or one
  step to the top. How many
  possibilities are to reach (N,N) from
  (0,0)?


Constraints


Assume input will be a positive integer N satisfying 1 &lt;= N &lt;= 125
No special characters, only 0-9
Output should be in a separate line for ever test-case.


Sample test Cases:

Input:

32
99
111
98
101
69
23
56
125
115


Output:

1832624140942590534
22750883079422934966181954039568885395604168260154104734000
360523470416823805932455583900004318515997845619425384417969851840
5716592448890534420436582360196242777068052430850904489000
360401018730232861668242368169788454233176683658575855546640
23623985175715118288974865541854103729000
8233430727600
390590044887157789360330532465784
91208366928185711600087718663295946582847985411225264672245111235434562752
90678241309059123546891915017615620549691253503446529088945065877600


Good luck!

The shorter an answer is, the better!
PARI GP

binomial(2*n,n)


Mathematica

Binomial[2n, n]