Game of Connections

This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, ... , 2n - 1, 2n consecutively in clockwise order on the ground to form a circle, and then, to draw some straight line segments to connect them into number pairs. Every number must be connected to exactly one another. And, no two segments are allowed to intersect. 

It's still a simple game, isn't it? But after you've written down the 2n numbers, can you tell me in how many different ways can you connect the numbers into pairs? Life is harder, right? 

InputEach line of the input file will be a single positive number n, except the last line, which is a number -1. You may assume that 1 <= n <= 100. 
OutputFor each n, print in a single line the number of ways to connect the 2n numbers into pairs. 
Sample Input

2
3
-1

Sample Output

2
5

卡兰特数套公式
java大法好啊！

import java.util.*;
import java.math.*;
public class Main 
{
 public static BigInteger TM;
 public static void main(String[] args)
 {
  Scanner sc=new Scanner(System.in);
  while(sc.hasNext())
  {
   int n=sc.nextInt();
   if(n==-1)
       break;
   int a,b;
   TM=BigInteger.ONE;
   TM=TM.multiply(BigInteger.valueOf(2));
   if(n==1)
   {
       System.out.println(1);
       continue;
   }
   if(n==2)
   {
       System.out.println(2);
       continue;
   }
   for(int i=3;i<=n;i++)
   {
       a=4*i-2;
       b=i+1;
    TM=TM.multiply(BigInteger.valueOf(a));
    TM=TM.divide(BigInteger.valueOf(b));
   
   }
   System.out.println(TM);
  }
 }
}