#include <bits/stdc++.h>
const int mod = 998244353;
using namespace std;
const int maxn = 110;
long long fac[maxn], inv[maxn];
long long cnt[80];
long long quick_mod(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b % 2) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
void init() {
  fac[0] = 1;
  for (long long i = 1; i <= maxn; ++i) fac[i] = fac[i - 1] * i % mod;
  inv[maxn] = quick_mod(fac[maxn], mod - 2);
  for (long long i = maxn - 1; i >= 0; --i) inv[i] = inv[i + 1] * (i + 1) % mod;
}
long long A(long long n, long long m) { return fac[n] * inv[n - m] % mod; }
int main() {
  int s, v1, v2, t1, t2;
  cin >> s >> v1 >> v2 >> t1 >> t2;
  int a = v1 * s + 2 * t1;
  int b = v2 * s + 2 * t2;
  if (a < b)
    puts("First");
  else if (a > b)
    puts("Second");
  else
    puts("Friendship");
  return 0;
}
