class Node:
    def __init__(self, val, nextNode):
        self.nextNode = nextNode
        self.val = val


node10 = Node(1, None)
node9 = Node(8, node10)
node8 = Node(8, node9)
node7 = Node(8, node8)
node6 = Node(8, node7)
node5 = Node(6, node6)
node4 = Node(5, node5)
node3 = Node(8, node4)
node2 = Node(3, node3)
node1 = Node(2, node2)
node0 = Node(1, node1)


def remove_duplicate(head, val):
    cursor = head
    last = None
    final = None

    while True:
        if cursor is None:
            break

        if cursor.val == val:
            if last is not None:
                last.nextNode = cursor.nextNode

        else:
            last = cursor
            if final is None:
                final = cursor

        cursor = cursor.nextNode

    return final


def list_nodes(nodes):
    curr = new_head
    while True:
        print curr.val
        if curr.nextNode:
            curr = curr.nextNode
        else:
            break


new_head = remove_duplicate(node0, 8)
list_nodes(new_head)