You are given a tree (an acyclic undirected connected graph) with *n* nodes. The tree nodes are numbered from 1 to *n*.

Each node has a color, white or black. All the nodes are black initially.

We will ask you to perfrom some instructions of the following form:

- 0
*u*: ask for how many nodes are connected to*u*, two nodes are connected iff all the node on the path from*u*to*v*(inclusive*u*and*v*) have a same color. - 1
*u*: toggle the color of*u*(that is, from black to white, or from white to black).