#include<stdio.h>
#include<stdlib.h>
#include<ctype.h>
struct Node {
    int data;
    struct Node* left;
    struct Node* right;
};
struct Node* createNode(int value) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = value;
    newNode->left = newNode->right = NULL;
    return newNode;
}
struct Node* insert(struct Node* root, int value) {
    if (value < root->data) {
        root->left = insert(root->left,value);
    } else {
        root->right = insert(root->right,value);
    }
    return root;
}
void inorder(struct Node* root) {
    if (root == NULL) return;
    inorder(root->left);
    printf("%d\n",->right);
    inorder(root->right);
}
int isValidInteger(char *str, int *num) {
    char *endptr;
    long val = strtol(str, &endptr, 10);
    if(*endptr != '\0') return 0;
    if(val < -100 || val > 100) return 0;
    *num = (int)val;
    return 1;
}
int main() {
    int n;
    if (scanf("%d", &n) != 1 || n < 0 || n > 10) {
        printf("Invalid input\n");
        return 0;
    }
    if (n == 0)
    printf("Tree is Empty\n");
    return 0;
}
struct Node* root = NULL;
char buffer[50];
int value;
for (int i = 0; i < n; i++) {
    if (scanf("%s", buffer) != 1) {
        printf("Invalid input\n");
        return 0; 
    }
    if (!isValidInteger(buffer,&value)) {
        printf("Invalid input\n";)
    }
    inorder(root);
    return 0;
}