#include<bits/stdc++.h>
using namespace std;
int n,ans;
int main()
{
	cin >> n;
	int j;
	for(j = 0; n; j++)
	{
		if(n%3==1&&ans==0)ans = j+1;
		n -= (n+2)/3;
	}
	cout << j << " " << ans << endl;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll d[100009], c[100009], w[100009], ans;
int n,k;
int main()
{
	cin >> n >> k;
	for(int i = 1; i < n; i++)
	{
		cin >> d[i];
		d[i]+=d[i-1];
	}
	for(int i = 0; i < n; i++)
	{
		cin >> c[i];
	}
	w[0]=0;
	int i,j;
	for(i = 0, j = 1; i < n-1; i++)
	{
		if(c[i] < c[w[j-1]])w[j++]=i;
	}
	w[j]=n-1;
	for(ll i = 0, rem = 0; i < j; i++)
	{
		ll pt1 = (d[w[i]]+k-1)/k*k, pt2 = (d[w[i+1]]+k-1)/k*k;
		ans += c[w[i]]*(pt2-pt1)/k;
	}
	cout << ans;
	return 0;
}