#include<stdio.h>
#include<stdlib.h>
typedef struct node {
    int data;
    struct node *left,*right;
}Node;
Node *root=NULL;
Node *create(int num) {
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
void *insert(Node *root,int num) {
    if(root==NULL)
    return create(num);
    if(num>root->data)
    root->right=insert(root->right,num);
    else if(num<root->data)
    root->left=insert(root->left,num);
    return root;
}
void *inOrder(Node *root) {
    if(root==NULL) {
        inOrder(root->left);
        printf("%d",root->data);
        inOrder(root->right);
    }
}
void maximum(int num) {
    if(root==NULL) 
        return num;
    else
     return maxinum(root->right);
    return num;
}


int main()
{
    int itr,num,size;
    scanf("%d",&size);
    if(size<0) {
        printf("Invalid input");
        return 0;
    }
    for(itr=1;it)
    
}