#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  long long int r, i;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long int power(long long int x, long long int y) {
  long long int temp, ty, my;
  long long int mod;
  mod = 1000000007;
  if (y == 0) return 1;
  temp = power(x, y / 2);
  ty = (temp % mod) * (temp % mod);
  if (y % 2 == 0) {
    return ty % mod;
  } else {
    my = (x % mod) * (ty % mod);
    return my % mod;
  }
}
long long int mini(long long int a, long long int b) { return a < b ? a : b; }
long long int maxi(long long int a, long long int b) { return a > b ? a : b; }
struct abhi {
  long long int val;
  long long int pos;
};
struct abhi brr[100010];
bool cmp(struct abhi x, struct abhi y) { return x.pos < y.pos; }
char ss[100010];
long long int a[200100];
long long int b[200100];
vector<pair<int, int> > abhi;
int strr[1020];
void SieveOfEratosthenes(int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * 2; i <= n; i += p) prime[i] = false;
    }
  }
  for (int p = 2; p <= n; p++)
    if (prime[p]) cout << p << " ";
}
long long int mod = 1000000007;
int main() {
  long long int t, m, i, n, r, c, w, j, k = 0, p, kk = 0;
  long long int v1, v2, t1, t2;
  string st;
  cin >> t >> v1 >> v2 >> t1 >> t2;
  long long int k1 = t * v1 + 2 * t1;
  long long int k2 = t * v2 + 2 * t2;
  if (k1 < k2) {
    cout << "First\n";
  } else if (k1 == k2) {
    cout << "Friendship\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
