#include <bits/stdc++.h>

using namespace std;
queue<int> a;
int main()
{

    int n;
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        a.push(i);
    }
    int c=0,e=0;
    int day=1;
    int d;
    while(a.size())
    {
        if(a.front()<=c)
        {
            day++;
            c=0;
            e=0;
        }
        e++;
        if(e%3==1)
        {
            if(a.front()==n)
                d=day;
            c=a.front();
            //cout<<a.front()<<" "<<day<<endl;
            a.pop();

            //e++;
        }
        else
        {
            //e++;
            c=a.front();
            a.push(a.front());
            //cout<<a.front()<<endl;
            a.pop();
        }

    }
    cout<<day<<" "<<d;


    return 0;
}