130.c: done
A kind of DP(top down with memoization).
To build a result, we follow the next 2 steps.

	result: f(n)

step 1) Choose an edge that it exists all the time,
	and the result is f(n-1)
step 2) Make the same edge does not exist all the time,
	and the result is res(use the following algorithm
	to compute it *initialize f(0)=1*)
	for( i=1, res=0; i<N; i++)
	{
		for( j=i; j<N; j++)
			res = f(i-1) * f(j-i) * f(N-1-i);
	}
step 3) f(n) = f(n-1) + res;

    graph for step 2) (step by step)
	   .   .

	.         .

	.         .

	   .   .

	   .   .
	 /
	.    /    .
	   /
	.         .

	   .   .

	   .   .
	 /
	.         .

	.---------.

	   .   .

	   .   .
	 /
	.         .

	.         .
	 \
	   .   .

	   .   .

	.---------.

	.---------.

	   .   .

	   .   .

	.---------.

	.         .
	 \
	   .   .
	   .   .

	.         .
	  \
	.   \     .
	 \    \
	   .   .