PAT A1115

#include <iostream>
#include <queue>
using namespace std;
struct node{
	int data,layer;
	node *lchild,*rchild;
};
node* createnode(int x){
	node* root=new node;
	root->data=x;
	root->lchild=root->rchild=NULL;
	return root;
}
void createtree(node* &root,int x){
	if(root==NULL){
		root=createnode(x);
		return;
	}
	if(root->data>=x) createtree(root->lchild,x);
	else createtree(root->rchild,x);
}
int layernum[1010]={0},maxlayer=0;
void BFS(node* root){
	queue<node*> q;
	q.push(root);
	root->layer=1;
	while(!q.empty()){
		node* t=q.front();
		q.pop();
		layernum[t->layer]++;
		if(t->layer>maxlayer) maxlayer=t->layer;
		if(t->lchild!=NULL){
			t->lchild->layer=t->layer+1;
			q.push(t->lchild);
		}
		if(t->rchild!=NULL){
			t->rchild->layer=t->layer+1;
			q.push(t->rchild);
		}
	}
}
int main(){
	int N,temp;
	scanf("%d",&N);
	node *root=NULL;
	for(int i=0;i<N;i++){
		scanf("%d",&temp);
		createtree(root,temp);
	}
	BFS(root);
	printf("%d + %d = %d",layernum[maxlayer],layernum[maxlayer-1],layernum[maxlayer]+layernum[maxlayer-1]);
	return 0;
}