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

typedef long long LL;

const int MAXN=65;
LL n;
int A[MAXN];
int pos=0;

void D(LL x){
	memset(A,0,sizeof(A));
	pos=0;
//	printf("%d\n",x);
	while(x){
		A[pos++]=x&1;
		x>>=1;
	}
//	for(int i=0;i<pos;i++) printf("%d ",A[i]);putchar('\n');
}

int main(){
	freopen("solo.in","r",stdin);
	freopen("solo.out","w",stdout);
	cin>>n;
	double ans=0;
	for(int i=0;i<n;i++){
		D(i);
		double P=1;
		for(int j=0;j<pos;j++) if(A[j]) P=P*0.25;else P=P*0.75;
		ans=P*i+ans;
	}
	printf("%.6e\n%.6e\n",ans,n-1-ans);
	return 0;
}