Consider a random binary tree on which Breadth-First Search is applied starting from the root node. There exist a node A and B at the distance six from the root. If A is the n^th node with a maximum possible value of n and B is the n^th node with a minimum possible value of n in the Breadth First Search traversal. The value of A + B is _____.(Root node is 1^st  node)