#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
char s[65536],s2[65536];
struct Tree{
    char s;
    struct Tree *l,*r;
};
typedef struct Tree Tr;
Tr root;
floor
int find(char &m[],int len,char tmp){
    for(int i=0;i<len;i++)
    if(m[i]==tmp)return i;
}
void Build1(Tr *k,int rt,int c){
    if(c==1){
    char tmp=s[1];
    int flg=find(s2,rt,tmp);
    if(flg==rt){}
    else
    {
        k=(Tr*)malloc(sizeof(Tr));
        k->s=s[1];
    }
    }
    if(c==2){
    
    
    
    
    }
}
void C1(){
    printf("请输入层序遍历：");scanf("%s",s);
    printf("请输入中序遍历：");scanf("%s",s2);
    int len=strlen(s),len2=strlen(s2);
    root.s=s[0];int index=find(s2,len2,s[0]);
    
    
}
int main()
{
    int c;
    while(1)
    {
        memset(s,0,sizeof(s));
        scanf("%d",&c);
        printf("%d",&c);
        if(c==1){
        
        
        }
        else{
        
        
        }
    }
    return 0;
}
/*

层：hdgacfbe

中：adcbhfeg

先：hdacbgfe

后：abcdefgh

*/