Depozit

#include <cstdio>
#define M 1000000007
using namespace std;

int p_log(int n,int p)
{
    int r;
    for(r=1;p;p>>=1) /// Calculez n^p modulo M
    {
        if(p&1)
            r=((long long)r*n)%M;
        n=((long long)n*n)%M;
    }
    return r;
}

int main(void)
{
	int n;
	scanf("%d",&n);
	printf("%d %d\n",(p_log(2,n)-1+M)%M,(p_log(2,n+1)-n-2+M)%M);
	return 0;
}