Given a tree T with n nodes and n - 1 edges rooted at node 1. Each nodes can be of two types namely "Sad" and "Happy". You can perform 2 operations each with a unit cost :
Given the current and final state of tree. Find the minimum cost required for the transformation.
Constraints :
Input :
Note : "0" denotes "Sad" State and "1" denotes "Happy" State
Output :
Print one line containing the minimum cost as described above.