#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 2000100
using namespace std;
const int mod=1e9+7;
int n,N,cnt,inv[10],value[1010],vis[1010],check[MAXN],phi[MAXN],prime[MAXN];
inline int read(){
	int x=0,f=1;  char ch=getchar();
	while(ch>'9'||ch<'0')  {if(ch=='-')  f=-1;  ch=getchar();}
	while(ch>='0'&&ch<='9')  {x=x*10+ch-'0';  ch=getchar();}
	return x*f;
}
inline int add(int a,int b){return (a+=b)>=mod?a-mod:a;}
inline int sub(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline int fast(int a,int b){int ret(1);for(;b;b>>=1,a=mul(a,a))if(b&1)ret=mul(ret,a);return ret;}
inline int getsum(int l,int r){return mul(mul(add(l,r),add(sub(r,l),1)),inv[2]);}
void pre(){
	N=2000000;  phi[1]=1;  inv[2]=fast(2,mod-2);  inv[6]=fast(6,mod-2);
	for(int i=2;i<=N;++i){
		if(!check[i]) prime[++cnt]=i,phi[i]=i-1;
		for(int j=1;j<=cnt&&prime[j]*i<=N;++j){
			check[prime[j]*i]=1;
			if(i%prime[j]==0) {phi[prime[j]*i]=phi[i]*prime[j]; break;}
			phi[prime[j]*i]=phi[i]*phi[prime[j]];
		}
	}
	for(int i=1;i<=N;++i) phi[i]=add(phi[i-1],mul(i,phi[i]));
}
int solve(int x){
	int pos=n/x;
	if(x<=N) return phi[x];
	if(vis[pos])  return value[pos];
	vis[pos]=1;  value[pos]=mul(mul(x,mul(add(x,1),add(mul(x,2),1))),inv[6]);
	for(int i=2,last=0;i<=x;i=last+1){
		last=x/(x/i);
		value[pos]=sub(value[pos],mul(solve(x/i),getsum(i,last)));
	}
	return value[pos];
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	n=read();  pre();
	printf("%d\n%d\n",1,solve(n));
	return 0;
}