unordered_map

#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <unordered_map>
#define inf 2147483647
#define N 1000010
#define p(a) putchar(a)
#define For(i,a,b) for(int i=a;i<=b;++i)

using namespace std;
unordered_map<int,bool>m;
void in(int &x){
    int y=;char c=getchar();x=;
    while(c<''||c>''){if(c=='-')y=-;c=getchar();}
    while(c<=''&&c>=''){ x=(x<<)+(x<<)+c-'';c=getchar();}
    x*=y;
}
void o(int x){
    if(x<){p('-');x=-x;}
    if(x>)o(x/);
    p(x%+'');
}

signed main(){
    m[]=;
    o(m[]);
    return ;
}