public static ListNode rotateRight(ListNode head, int n) {
		if (head == null || head.next == null || n == 0)
			return head;
		ListNode l1 = head, l2 = head;
		while (n > 0) {
			l1 = l1.next;
			if (l1 == null) {
				l1 = head;
			}
			n--;
		}
		if (l1 == head)
			return head;
		while (l1.next != null) {
			l1 = l1.next;
			l2 = l2.next;
		}
		l1.next = head;
		ListNode result = l2.next;
		l2.next = null;
		return result;
	}