public int circularHead(Node node)
	{
		if(node == null)
			return -1;
		else
		{
			Node slow = node;
			Node fast = node;
			
			while(fast.next != null)
			{
				slow = slow.next;
				if(fast.next.next == null)
				{
					return -1;
				}
				else
				{
					fast = fast.next.next;
				}
				
				if(slow == fast)
				{
					break;
				}				
			}
			slow = node;
			while(fast.next !=null && slow.next != null)
			{
				slow = slow.next;
				fast = fast.next;
				
				if(slow == fast)
					return slow.item;
			}
			
		}	
		return -1;
	}