void insert(int d) {
Node6 p = new Node6(d);
if (start == null) start = p;
else {
Node6 q = start;
while (q.next != null) q = q.next;
q.next = p;
}
}
void makeIntersect(Node6 n) {
Node6 q = this.start;
if (q == null) q = n;
while (q.next != null) q = q.next;
q.next = n;
}
