这个题很简单。不要看错题,算一下比一下就好了
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <utility>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <queue>
#include <deque>
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define LL long long
#define Pair pair<int,int>
#define LOWBIT(x) x & (-x)
using namespace std;
const int MOD=1e9+7;
const int INF=0x7ffffff;
const int magic=348;
int main ()
{
int s,v1,v2,t1,t2;
scanf("%d%d%d%d%d",&s,&v1,&v2,&t1,&t2);
int s1=t1*2+s*v1,s2=t2*2+s*v2;
if (s1<s2) printf("First\n");
if (s1>s2) printf("Second\n");
if (s1==s2) printf("Friendship\n");
return 0;
}