#include <bits/stdc++.h>
using namespace std;
struct NODE{
	int data;
	NODE *next; 
};
int main()
{
	int n;	cin >> n;
	NODE *head, *now, *p, *prev;
	head = new NODE;  head -> data = 1;  head -> next = NULL;
	now = head;
	for(int i = 2;i <= n;i++){
		p = new NODE;  p -> data = i; p -> next = NULL;
		now -> next = p;
		now = p;
	}
	now -> next = head;
	prev = now, now = head;
	int ans1, a = n, ans2 = 0;
	while(n > 0){
		ans2 ++;
		int s = n;
		for(int i = 1;i <= s;i++){
			if(i % 3 == 1){
				if(now -> data == a)
					ans1 = ans2;
				n--;
				prev -> next = now ->next;
				delete now;
				now = prev;
			}
			prev = now;
			now = now -> next;
		}
	}
	cout << ans2 << ' ' << ans1;
    return 0;
}