Codeforces Round #382 (Div. 2)-C. Tennis Championship

原题链接

C. Tennis Championship

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if someone loses a game he leaves the tournament immediately.

Organizers are still arranging tournament grid (i.e. the order games will happen and who is going to play with whom) but they have already fixed one rule: two players can play against each other only if the number of games one of them has already played differs by no more than one from the number of games the other one has already played. Of course, both players had to win all their games in order to continue participating in the tournament.

Tournament hasn't started yet so the audience is a bit bored. Ostap decided to find out what is the maximum number of games the winner of the tournament can take part in (assuming the rule above is used). However, it is unlikely he can deal with this problem without your help.

Input

The only line of the input contains a single integer n (2 ≤ n ≤ 1018) — the number of players to participate in the tournament.

Output

Print the maximum number of games in which the winner of the tournament can take part.

Examples

input

2

output

1

input

3

output

2

input

4

output

2

input

10

output

4

假设num[i]表示最后的赢家赢i场需要的最少的参赛人数，那么num[i] = num[i-1] + num[i-2]是斐波那契数列，把long long 范围内的斐波那契数全部找出，根据n找到最大num[i]并且num[i] <= n那么i就是答案

#include <bits/stdc++.h>
#define maxn 200005
#define MOD 1000000007
using namespace std;
typedef long long ll;

ll num[105];
int main(){
	
	num[0] = 1;
	num[1] = 2;
	for(int i = 2; i <= 90; i++){
		num[i] = num[i-1] + num[i-2];
	}
	ll n;
	scanf("%I64d", &n);
	int d = upper_bound(num, num + 91, n) - num;
	printf("%d\n", d - 1);
	return 0;
}