Round #427 A. Key races(Div.2)

 

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1milliseconds and has ping t1 milliseconds. The second participant types one character in v2milliseconds and has ping t2 milliseconds.

If connection ping (delay) is t milliseconds, the competition passes for a participant as follows:

1. Exactly after t milliseconds after the start of the competition the participant receives the text to be entered.
2. Right after that he starts to type it.
3. Exactly t milliseconds after he ends typing all the text, the site receives information about it.

The winner is the participant whose information on the success comes earlier. If the information comes from both participants at the same time, it is considered that there is a draw.

Given the length of the text and the information about participants, determine the result of the game.

Input

The first line contains five integers s, v1, v2, t1, t2 (1 ≤ s, v1, v2, t1, t2 ≤ 1000) — the number of characters in the text, the time of typing one character for the first participant, the time of typing one character for the the second participant, the ping of the first participant and the ping of the second participant.

Output

If the first participant wins, print "First". If the second participant wins, print "Second". In case of a draw print "Friendship".

Examples

input

5 1 2 1 2

output

First

input

3 3 1 1 1

output

Second

input

4 5 3 1 5

output

Friendship

Note

In the first example, information on the success of the first participant comes in 7 milliseconds, of the second participant — in 14 milliseconds. So, the first wins.

In the second example, information on the success of the first participant comes in 11milliseconds, of the second participant — in 5 milliseconds. So, the second wins.

In the third example, information on the success of the first participant comes in 22 milliseconds, of the second participant — in 22 milliseconds. So, it is be a draw.

//看懂题意就好啦，，英语没学好，就是蓝瘦，先后场等待t时间，然后根据自己的速度所需要花费时间，最后话费t时间交

#include <iostream>
#include <stdio.h>
using namespace std;
 
int main(){
	int s,v1,v2,t1,t2;
	scanf("%d %d %d %d %d", &s ,&v1, &v2, &t1, &t2);
	int m=t1+s*v1+t1;
	int n=t2+s*v2+t2;
	if(m<n) printf("First\n");
	else if(m>n) printf("Second\n");
	else printf("Friendship\n");
	return 0;
}