private static Node[] splitInHalf(Node h){
		Node[] ret = new Node[2];
		int l = findLength(h);
		int cnt = 0;
		Node ori = h;
		while(cnt<l/2-1){
			cnt++;
			h=h.next;
		}
		ret[1]=h.next;
		h.next = null;
		ret[0]=ori;
		return ret;
	}