Codeforces Round #427 (Div. 2) Problem A Key races (Codeforces 835 A)

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 v₁ milliseconds and has ping t₁ milliseconds. The second participant types one character in v₂ milliseconds and has ping t₂ 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, v₁, v₂, t₁, t₂ (1 ≤ s, v₁, v₂, t₁, t₂ ≤ 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 11 milliseconds, 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.

---

　　题目大意 两个人开始打字游戏，每个人有一个速度，以及发送打字的文本串和提交文本串会有一个延时。问谁会赢。

　　按照题目意思，算出运营商收到两人的提交文本最少要耗的时间。

Code

/**
 * Codeforces
 * Problem#835A
 * Accepted
 * Time:30ms
 * Memory:2100k
 */ 
#include <bits/stdc++.h> 
#ifndef WIN32
#define Auto "%lld"
#else
#define Auto "%I64d"
#endif
using namespace std;
typedef bool boolean;
const signed int inf = (signed)((1u << 31) - 1);
const signed long long llf = (signed long long)((1ull << 61) - 1);
const double eps = 1e-6;
const int binary_limit = 128;
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
template<typename T>
inline boolean readInteger(T& u){
    char x;
    int aFlag = 1;
    while(!isdigit((x = getchar())) && x != '-' && x != -1);
    if(x == -1) {
        ungetc(x, stdin);    
        return false;
    }
    if(x == '-'){
        x = getchar();
        aFlag = -1;
    }
    for(u = x - '0'; isdigit((x = getchar())); u = (u << 1) + (u << 3) + x - '0');
    ungetc(x, stdin);
    u *= aFlag;
    return true;
}

int s, v0, v1, t0, t1;

inline void init() {
    scanf("%d%d%d%d%d", &s, &v0, &v1, &t0, &t1);
}

inline void solve() {
    int a = 2 * t0 + s * v0;
    int b = 2 * t1 + s * v1;
    if(a > b)
        puts("Second");
    else if(a < b)
        puts("First");
    else
        puts("Friendship");
}

int main() {
    init();
    solve();
    return 0;
}