How do you find the node where a linked list cycle begins?

class ListNode:
    def __init__(self, val, nxt=None):
        self.val, self.next = val, nxt

def detect_cycle(head):
    slow = fast = head
    while fast and fast.next:           # phase 1: detect
        slow = slow.next
        fast = fast.next.next
        if slow is fast:
            slow = head                 # phase 2: locate
            while slow is not fast:
                slow = slow.next
                fast = fast.next
            return slow
    return None


# --- demo ---  1->2->3->4->5 with tail looping back to node 2
n1, n2, n3, n4, n5 = ListNode(1), ListNode(2), ListNode(3), ListNode(4), ListNode(5)
n1.next, n2.next, n3.next, n4.next, n5.next = n2, n3, n4, n5, n2  # cycle
start = detect_cycle(n1)
print(start.val if start else None)   # 2