#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int maxn=;

int first[maxn],tot,size[maxn],n,p,top[maxn];

int mx,mxi,mi,mii;

bool ans[maxn],z[maxn];

struct edge{int v,from;}e[maxn*];

void insert(int u,int v){tot++;e[tot].v=v;e[tot].from=first[u];first[u]=tot;}

void dfs(int x,int fa){

    size[x]=;z[x]=;

    for(int i=first[x];i;i=e[i].from)if(e[i].v!=fa){

        dfs(e[i].v,x);

        size[x]+=size[e[i].v];

        if(size[e[i].v]>n/)z[x]=;

    }

    if(n-size[x]>n/)z[x]=;

    if(z[x]){if(p)p=;else p=x;}

}

void DFS(int x,int fa,int tp){

    size[x]=;top[x]=tp;

    for(int i=first[x];i;i=e[i].from)if(e[i].v!=fa){

        DFS(e[i].v,x,tp);

        size[x]+=size[e[i].v];

    }

}

int main(){

    scanf("%d",&n);

    int u,v;

    for(int i=;i<n;i++){

        scanf("%d%d",&u,&v);

        insert(u,v);insert(v,u);

    }

    dfs(,);

    if(!p){for(int i=;i<=n;i++)printf("1 ");return ;}

    for(int i=first[p];i;i=e[i].from){

        DFS(e[i].v,p,e[i].v);

        if(size[e[i].v]>mx){

            mi=mx;mii=mxi;

            mx=size[e[i].v];

            mxi=e[i].v;

        }

        else if(size[e[i].v]>mi)mi=size[e[i].v],mii=e[i].v;

    }

    ans[p]=;

    for(int i=;i<=n;i++)if(i!=p){

        if(mxi==top[i])u=mi;else u=mx;

        if(n-size[i]-u<=n/)ans[i]=;

    }

    for(int i=;i<=n;i++)printf("%d ",ans[i]);

    return ;

}