#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
using namespace std;

typedef long long int LL;
const int maxn=1234567+1;
const int mod=233333333;
int ans[maxn]={0,2};

int main()
{
    for(int i=2;i<=1234567;i++)
    {
        ans[i]=(2*ans[i-1]+2
 
)%mod;
    }
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int res1=ans[n];
        int res2=(ans[n]*2-1)%mod;
        printf("%d %d\n",res1,res2);
    }
    return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const
 
 int INF=0x3f3f3f3f;
const int MAXN=50;
int a[MAXN];
int ans,n;

void dfs(int pos,int k,int gap)
{
    if(pos==n||gap<=k+1) return;
    for(int i=pos+1;i<=n;i++)
    {
        if(a[i]-a[pos]>k+1)
        {
            dfs(i,k+1,min(gap,a[i]-a[pos]));
            ans++;
        }
    }
}

int main
 
()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        ans=0;
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        for(int i=1;i<=n;i++)
            dfs(i,1,INF);
        printf("%d\n",ans);
    }
    return 0;
}

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
const double eps=1e-6;
const int MAXN=50;
typedef pair<double,double> PDD;
set<PDD> s;


int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        s.clear();
        int op;
        double x,y;
        for(int i=1;i<=n;i++)
        {
            scanf("%d%lf%lf",&op,&x,&y);
            PDD tmp=make_pair(x,y);
            if(op==0)
            {
                if(!s.empty())
                {
                    auto p=s.begin(),q=s.end();q--;
                    if(!s.empty()&&(*p).first<=x&&(*q).first>=x)
                        printf("Yes\n");
                    else printf("No\n");
                }else
                {
                    printf("No\n");
                }
            }else if(op==1)
            {
                s.insert(tmp);
            }else
            {
                auto p=s.find(tmp);
                if(p!=s.end())
                {
                    s.erase(p);
                }
            }
        }
    }
    return 0;
}

#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int maxn=55;
char c;
int a[maxn][maxn],n,m,sx,sy,ex,ey,sd;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
bool vis[maxn][maxn][5];
struct node
{
    int x,y,d,step;//用d（0、1、2、3、4）表示不同朝向
    bool operator < (const node &a) const{
        return a.step<step;
    }
};
priority_queue<node> q;
//queue<node> q;

bool check(int x,int y)
{
    if(x>=n||y>=m||x<=0||y<=0)
        return false;
    if(a[x][y]==1||a[x+1][y]==1||a[x][y+1]==1||a[x+1][y+1]==1)
        return false;
    return true;
}

void bfs()
{
    memset(vis,false,sizeof(vis));
    node now,next;
    now.x = sx;
    now.y = sy;
    now.d = sd;
    now.step = 0;
    if(!check(sx,sy))
    {
        printf("-1\n");
        return ;
    }
    if(!check(ex,ey))
    {
        printf("-1\n");
        return ;
    }
    while(!q.empty()) q.pop();
    q.push(now);
    vis[sx][sy][sd] = true;
    while(!q.empty())
    {
        now = q.top();
        q.pop();
        //printf("%d %d %d %d\n",now.x,now.y,now.d,now.step);
        if(now.x==ex&&now.y==ey)
        {
            printf("%d\n",now.step);
            return ;
        }
        for(int step=1;step<=3;step++)
        {
            next.x = now.x+dx[now.d]*step;
            next.y = now.y+dy[now.d]*step;
            next.d = now.d;
            if(check(next.x,next.y)&&vis[next.x][next.y][next.d]==false)
            {
                next.step = now.step+1;
                q.push(next);
                vis[next.x][next.y][next.d] = true;
            }
            else//如果1 2 3某一個不能走，那後面的肯定不能走
            {
                break;
            }
        }
        if(vis[now.x][now.y][(now.d+1)%4]==false)//ÓÒת
        {
            next.x = now.x;
            next.y = now.y;
            next.d = (now.d+1)%4;
            next.step = now.step+1;
            q.push(next);
            vis[next.x][next.y][next.d] = true;
        }
        if(vis[now.x][now.y][(now.d-1+4)%4]==false)//×óת
        {
            next.x = now.x;
            next.y = now.y;
            next.d = (now.d-1+4)%4;
            next.step = now.step+1;
            q.push(next);
            vis[next.x][next.y][next.d] = true;
        }
    }
    printf("-1\n");
}
int main()
{
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                scanf("%d\n",&a[i][j]);
            }
        }
        scanf("%d %d %d %d",&sx,&sy,&ex,&ey);
        getchar();
        scanf("%c",&c);
        if(sx==ex&&sy==ey)
        {
            printf("0\n");
            continue;
        }
        if(c=='E') sd=0;
        else if(c=='S') sd=1;
        else if(c=='W') sd=2;
        else if(c=='N') sd=3;
        bfs();
    }
}