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_1 milliseconds and has ping t_1 milliseconds. The second participant types one character in v_2 milliseconds and has ping t_2 milliseconds.

If connection ping (delay) is t milliseconds, the competition passes for a participant as follows:   Exactly after t milliseconds after the start of the competition the participant receives the text to be entered.  Right after that he starts to type it.  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_1, v_2, t_1, t_2 (1 ≤ s, v_1, v_2, t_1, t_2 ≤ 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.

Difficulty: EASY

Solutions:
a = list(map(int, input().split()))
x = a[0] * a[1] + 2 * a[3]
y = a[0] * a[2] + 2 * a[4]
if x < y:
	print('First')
elif y < x:
	print('Second')
else:
	print('Friendship')


(n, v1, v2, t1, t2) = [int(x) for x in input().split()]
(a, b) = (v1 * n + t1 * 2, v2 * n + t2 * 2)
if a == b:
	print('Friendship')
elif a < b:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
T1 = s * v1 + 2 * t1
T2 = s * v2 + 2 * t2
if T1 > T2:
	print('Second')
elif T2 > T1:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
first = s * v1 + 2 * t1
second = s * v2 + 2 * t2
if first < second:
	print('First')
elif second < first:
	print('Second')
else:
	print('Friendship')


(a, b, c, d, e) = map(int, input().split())
wynik_pierwsego = d + b * a + d
wynik_drugiego = e + c * a + e
if wynik_pierwsego < wynik_drugiego:
	print('First')
elif wynik_pierwsego > wynik_drugiego:
	print('Second')
elif wynik_drugiego == wynik_pierwsego:
	print('Friendship')


n = list(map(int, input().split()))
t1 = n[0] * n[1] + 2 * n[3]
t2 = n[0] * n[2] + 2 * n[4]
if t1 > t2:
	print('Second')
elif t1 < t2:
	print('First')
else:
	print('Friendship')


(s, a, b, c, d) = map(int, input().split())
e = 2 * (c - d) + s * (a - b)
print([['Friendship', 'First'][e < 0], 'Second'][e > 0])


print(['Friendship', 'Second', 'First'][(lambda x: -1 if x < 0 else 1 if x > 0 else 0)((lambda s, v1, v2, t1, t2: 2 * t1 + s * v1 - (2 * t2 + s * v2))(*[int(x) for x in input().split()]))])


lectura = lambda : map(int, input().split())
(s, v1, v2, t1, t2) = lectura()
T1 = 2 * t1 + s * v1
T2 = 2 * t2 + s * v2
q = ('First', 'Second', 'Friendship')[T1 > T2]
if T1 == T2:
	q = 'Friendship'
print(q)


(a, b, c, d, e) = map(int, input().split())
b = b * a + 2 * d
c = c * a + 2 * e
if b > c:
	print('Second')
elif b < c:
	print('First')
else:
	print('Friendship')


test_data = [int(element) for element in input().split()]
time_1 = test_data[0] * test_data[1] + test_data[3] + test_data[3]
time_2 = test_data[0] * test_data[2] + test_data[4] + test_data[4]
if time_1 < time_2:
	print('First')
elif time_1 > time_2:
	print('Second')
else:
	print('Friendship')


from math import *
arr = list(map(int, input().split()))
(first, second) = (2 * arr[-2] + arr[0] * arr[1], 2 * arr[-1] + arr[0] * arr[2])
if first < second:
	print('First')
elif second < first:
	print('Second')
else:
	print('Friendship')


a = [int(i) for i in input().split()]
x1 = a[0] * a[1] + 2 * a[3]
x2 = a[0] * a[2] + 2 * a[4]
if x1 < x2:
	print('First')
elif x1 == x2:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
a = s * v1 + 2 * t1
b = s * v2 + 2 * t2
if a == b:
	print('Friendship')
elif a < b:
	print('First')
else:
	print('Second')


import sys
(s, v1, v2, t1, t2) = map(int, input().split())
p1 = s * v1 + t1 * 2
p2 = s * v2 + t2 * 2
if p1 < p2:
	print('First')
elif p1 == p2:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
one = s * v1 + t1 + t1
two = s * v2 + t2 + t2
if one < two:
	print('First')
elif one > two:
	print('Second')
else:
	print('Friendship')


l = tuple((int(i) for i in input().split()))
if l[0] * l[1] + 2 * l[3] == l[0] * l[2] + 2 * l[4]:
	print('Friendship')
elif l[0] * l[1] + 2 * l[3] < l[0] * l[2] + 2 * l[4]:
	print('First')
elif l[0] * l[1] + 2 * l[3] > l[0] * l[2] + 2 * l[4]:
	print('Second')


string = input()
string = string.split(' ')
s = int(string[0])
v1 = int(string[1])
v2 = int(string[2])
t1 = int(string[3])
t2 = int(string[4])

def problem6(s, v1, v2, t1, t2):
	person1 = [t1, v1]
	person2 = [t2, v2]
	time1 = s * v1 + 2 * t1
	time2 = s * v2 + 2 * t2
	if time1 < time2:
		print('First')
	elif time1 > time2:
		print('Second')
	else:
		print('Friendship')
problem6(s, v1, v2, t1, t2)


(s, v1, v2, t1, t2) = map(int, input().split(' '))
r = 2 * (t1 - t2) + s * (v1 - v2)
if r > 0:
	print('Second')
elif r < 0:
	print('First')
else:
	print('Friendship')


(t, s1, s2, p1, p2) = map(int, input().split())
time1 = t * s1 + p1 * 2
time2 = t * s2 + p2 * 2
if time1 < time2:
	print('First')
elif time1 != time2:
	print('Second')
else:
	print('Friendship')


n = input().split()
ans1 = 0
ans2 = 0
ans1 = int(n[3]) + int(n[0]) * int(n[1]) + int(n[3])
ans2 = int(n[4]) + int(n[0]) * int(n[2]) + int(n[4])
if ans1 > ans2:
	print('Second\n')
elif ans2 > ans1:
	print('First\n')
else:
	print('Friendship\n')


(s, v1, v2, t1, t2) = list(map(int, input().split()))
x1 = v1 * s + t1 * 2
x2 = v2 * s + t2 * 2
if x1 < x2:
	print('First')
elif x1 > x2:
	print('Second')
else:
	print('Friendship')


inp = [int(p) for p in input().split()]
first = inp[1] * inp[0] + inp[3] * 2
second = inp[2] * inp[0] + inp[4] * 2
if first < second:
	print('First')
elif first > second:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
re1 = s * v1 + 2 * t1
re2 = s * v2 + 2 * t2
if re1 < re2:
	print('First')
elif re1 > re2:
	print('Second')
else:
	print('Friendship')


x = [int(i) for i in input().split()]
(s, v1, v2, t1, t2) = (x[0], x[1], x[2], x[3], x[4])
(time1, time2) = (s * v1 + t1 * 2, s * v2 + t2 * 2)
if time1 < time2:
	print('First')
elif time1 == time2:
	print('Friendship')
else:
	print('Second')


l = list(input().split())
s = int(l[0])
v1 = int(l[1])
v2 = int(l[2])
t1 = int(l[3])
t2 = int(l[4])
if 2 * t1 + s * v1 > 2 * t2 + s * v2:
	print('Second')
elif 2 * t1 + s * v1 < 2 * t2 + s * v2:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = input().split()
s = int(s)
v1 = int(v1)
v2 = int(v2)
t1 = int(t1)
t2 = int(t2)
pl1 = 2 * t1 + s * v1
pl2 = 2 * t2 + s * v2
if pl1 == pl2:
	print('Friendship')
elif pl1 < pl2:
	print('First')
elif pl1 > pl2:
	print('Second')


a = list(map(int, input().split()))
s = a[0]
v1 = a[1]
v2 = a[2]
t1 = a[3]
t2 = a[4]
total1 = v1 * s + 2 * t1
total2 = v2 * s + 2 * t2
if total1 > total2:
	print('Second')
elif total1 < total2:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
ans1 = s * v1 + 2 * t1
ans2 = s * v2 + 2 * t2
if ans1 < ans2:
	print('First')
elif ans1 > ans2:
	print('Second')
else:
	print('Friendship')


(n, v1, v2, d1, d2) = map(int, input().split())
if n * v1 + 2 * d1 < n * v2 + 2 * d2:
	print('First')
elif n * v1 + 2 * d1 > n * v2 + 2 * d2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, p1, p2) = [int(i) for i in input().split(' ')]
a = s * v1 + 2 * p1
b = s * v2 + 2 * p2
if a < b:
	print('First')
elif a == b:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
tot1 = t1 + v1 * s + t1
tot2 = t2 + v2 * s + t2
if tot1 < tot2:
	print('First')
elif tot1 > tot2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
f = v1 * s + 2 * t1
s = v2 * s + 2 * t2
print('First' if s > f else 'Second' if s < f else 'Friendship')


from sys import stdin, stdout
(s, v1, v2, t1, t2) = map(int, stdin.readline().rstrip().split())
score1 = 2 * t1 + s * v1
score2 = 2 * t2 + s * v2
if score1 < score2:
	print('First')
elif score2 < score1:
	print('Second')
else:
	print('Friendship')


(s, u, v, t, c) = map(int, input().split())
if s * u + 2 * t < s * v + 2 * c:
	print('First')
elif s * u + 2 * t > s * v + 2 * c:
	print('Second')
else:
	print('Friendship')


import math
(s, v1, v2, t1, t2) = input().split()
if int(s) * int(v1) + 2 * int(t1) == int(s) * int(v2) + 2 * int(t2):
	print('Friendship')
elif int(s) * int(v1) + 2 * int(t1) < int(s) * int(v2) + 2 * int(t2):
	print('First')
else:
	print('Second')


import sys
(s, v1, v2, t1, t2) = map(int, sys.stdin.read().split())
a = s * v1 + 2 * t1
b = s * v2 + 2 * t2
if a < b:
	print('First')
elif a > b:
	print('Second')
else:
	print('Friendship')


def read():
	return [int(e) for e in input().split()]
x = read()
a = 2 * x[3] + x[0] * x[1]
b = 2 * x[4] + x[0] * x[2]
if a > b:
	print('Second')
elif a == b:
	print('Friendship')
else:
	print('First')


l = input()
l = l.split()
s = int(l[0])
v1 = int(l[1])
v2 = int(l[2])
t1 = int(l[3])
t2 = int(l[4])
a1 = s * v1 + 2 * t1
a2 = s * v2 + 2 * t2
if a1 > a2:
	print('Second')
if a1 < a2:
	print('First')
if a1 == a2:
	print('Friendship')


(n, v1, v2, t1, t2) = map(int, input().split())
r = n * v1 + t1 * 2
q = n * v2 + t2 * 2
if r < q:
	print('First')
elif r == q:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
r1 = 2 * t1 + s * v1
r2 = 2 * t2 + s * v2
if r1 > r2:
	print('Second')
elif r1 < r2:
	print('First')
else:
	print('Friendship')


lst = input().split()
j = 0
while j < len(lst):
	lst[j] = int(lst[j])
	j += 1
first = lst[0] + lst[1] * lst[0] + 2 * lst[3]
second = lst[0] + lst[2] * lst[0] + 2 * lst[4]
if first < second:
	print('First')
elif second < first:
	print('Second')
else:
	print('Friendship')


data = input().split(' ')
s = int(data[0])
v1 = int(data[1])
v2 = int(data[2])
t1 = int(data[3])
t2 = int(data[4])
result = t1 * 2 + v1 * s - (t2 * 2 + v2 * s)
if result > 0:
	print('Second')
elif result < 0:
	print('First')
else:
	print('Friendship')


user_input = list(map(int, input().split()))

class Competition:

	def __init__(self, s, v1, v2, t1, t2):
		self.s = s
		self.v1 = v1
		self.v2 = v2
		self.t1 = t1
		self.t2 = t2

	def winner(self):
		first = self.s * self.v1 + self.t1 * 2
		second = self.s * self.v2 + self.t2 * 2
		if first < second:
			print('First')
		elif first > second:
			print('Second')
		else:
			print('Friendship')
Competition(user_input[0], user_input[1], user_input[2], user_input[3], user_input[4]).winner()


[s, v1, v2, t1, t2] = list(map(int, input().split()))
n1 = t1 + s * v1 + t1
n2 = t2 + s * v2 + t2
if n1 < n2:
	print('First')
elif n1 > n2:
	print('Second')
else:
	print('Friendship')


(s, a, b, c, d) = map(int, input().split())
(e, f) = (s * a + 2 * c, s * b + 2 * d)
print('First' if e < f else 'Second' if f < e else 'Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
first = 2 * t1 + s * v1
second = 2 * t2 + s * v2
if first < second:
	print('First')
elif first == second:
	print('Friendship')
else:
	print('Second')


ins = input().split(' ')
n = int(ins[0])
v1 = int(ins[1])
v2 = int(ins[2])
t1 = int(ins[3])
t2 = int(ins[4])
a = n * v1 + 2 * t1
b = n * v2 + 2 * t2
if a < b:
	print('First')
elif a > b:
	print('Second')
else:
	print('Friendship')


import math

def main():
	(n, s1, s2, t1, t2) = map(int, input().split())
	first = n * s1 + 2 * t1
	second = n * s2 + 2 * t2
	if first == second:
		print('Friendship')
	elif first > second:
		print('Second')
	else:
		print('First')
main()


l = list(map(int, input().strip().split(' ')))
if l[1] * l[0] + 2 * l[3] < l[2] * l[0] + 2 * l[4]:
	print('First')
if l[1] * l[0] + 2 * l[3] == l[2] * l[0] + 2 * l[4]:
	print('Friendship')
if l[1] * l[0] + 2 * l[3] > l[2] * l[0] + 2 * l[4]:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
timeF = 2 * t1
timeS = 2 * t2
resF = 0
resS = 0
resultF = 0
resulS = 0
while resultF != s:
	resF += v1
	resultF += 1
while resulS != s:
	resS += v2
	resulS += 1
if timeF + resF < timeS + resS:
	print('First')
elif timeF + resF == timeS + resS:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
m = s * v1 + 2 * t1
n = s * v2 + 2 * t2
if m < n:
	print('First')
elif m == n:
	print('Friendship')
else:
	print('Second')


(s, v_1, v_2, t_1, t_2) = [int(num) for num in input().strip().split(' ')]

def compute_time(time_for_char, delay, num_chars):
	return 2 * delay + time_for_char * num_chars
(time_1, time_2) = (compute_time(v_1, t_1, s), compute_time(v_2, t_2, s))
if time_1 < time_2:
	print('First')
elif time_1 > time_2:
	print('Second')
else:
	print('Friendship')


(l, v1, v2, t1, t2) = (int(x) for x in input().split())
total_t1 = t1 + l * v1 + t1
total_t2 = t2 + l * v2 + t2
if total_t1 < total_t2:
	print('First')
elif total_t1 > total_t2:
	print('Second')
else:
	print('Friendship')


a = [int(i) for i in input().split(' ')]
s = a[0]
v1 = a[1]
v2 = a[2]
p1 = a[3]
p2 = a[4]
t1 = 2 * p1 + v1 * s
t2 = 2 * p2 + v2 * s
if t1 < t2:
	print('First')
elif t2 < t1:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
frst = 2 * t1 + s * v1
scnd = 2 * t2 + s * v2
if frst < scnd:
	print('First')
elif frst > scnd:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(r) for r in input().split()]
fst = s * v1 + 2 * t1
snd = s * v2 + 2 * t2
if fst < snd:
	print('First')
elif fst > snd:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
a = s * v1 + 2 * t1
b = s * v2 + 2 * t2
if a > b:
	print('Second')
elif a < b:
	print('First')
else:
	print('Friendship')


def caltime(s, v, t):
	return t + s * v + t
(s, v1, v2, t1, t2) = map(int, input().split())
first = caltime(s, v1, t1)
second = caltime(s, v2, t2)
if first < second:
	print('First')
elif first == second:
	print('Friendship')
else:
	print('Second')


def main():
	(w, s1, s2, p1, p2) = [int(x) for x in input().split()]
	t1 = 2 * p1 + s1 * w
	t2 = 2 * p2 + s2 * w
	if t1 < t2:
		print('First')
	if t2 < t1:
		print('Second')
	if t1 == t2:
		print('Friendship')
main()


from sys import stdin, stdout, exit as sys_ret
(f_input, f_print, f_flush) = (stdin.readline, stdout.write, stdout.flush)
(text, speed1, speed2, ping1, ping2) = map(int, f_input().split())
(first, second) = (ping1 * 2 + speed1 * text, ping2 * 2 + speed2 * text)
if first < second:
	f_print('First')
elif first > second:
	f_print('Second')
else:
	f_print('Friendship')


(sym_nr, speed1, speed2, ping1, ping2) = (int(x) for x in input().split())
time1 = speed1 * sym_nr + 2 * ping1
time2 = speed2 * sym_nr + 2 * ping2
if time1 < time2:
	print('First')
elif time2 < time1:
	print('Second')
else:
	print('Friendship')


(t, v1, v2, t1, t2) = list(map(int, input().split()))
if v1 * t + 2 * t1 > v2 * t + 2 * t2:
	print('Second')
elif v1 * t + 2 * t1 < v2 * t + 2 * t2:
	print('First')
else:
	print('Friendship')


s = input().rstrip().split(' ')
A = int(s[1]) * int(s[0]) + 2 * int(s[3])
B = int(s[2]) * int(s[0]) + 2 * int(s[4])
if A == B:
	print('Friendship')
elif A > B:
	print('Second')
else:
	print('First')


def read_input():
	input_str = str(input())
	return map(int, input_str.split(' '))

def get_winner_name(s: int, v1: int, v2: int, t1: int, t2: int) -> str:
	finish_time_first = s * v1 + t1 * 2
	finish_time_second = s * v2 + t2 * 2
	if finish_time_first == finish_time_second:
		return 'Friendship'
	elif finish_time_first < finish_time_second:
		return 'First'
	else:
		return 'Second'
(s, v1, v2, t1, t2) = read_input()
winner_name = get_winner_name(s, v1, v2, t1, t2)
print(winner_name)


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
tm1 = s * v1 + 2 * t1
tm2 = s * v2 + 2 * t2
if tm1 == tm2:
	print('Friendship')
elif tm1 > tm2:
	print('Second')
else:
	print('First')


import sys, math
from collections import defaultdict

def get_ints():
	return map(int, I().split())

def get_list():
	return list(map(int, I().split()))

def I():
	return sys.stdin.readline()
(s, v1, v2, t1, t2) = get_ints()
a = s * v1 + 2 * t1
b = s * v2 + 2 * t2
if a == b:
	print('Friendship')
elif a < b:
	print('First')
else:
	print('Second')


(k, m, n, o, x) = map(int, input().split())
count1 = k * m + 2 * o
count2 = k * n + 2 * x
if count2 > count1:
	print('First')
if count1 > count2:
	print('Second')
if count1 == count2:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
val1 = v1 * s + 2 * t1
val2 = v2 * s + 2 * t2
if val1 < val2:
	print('First')
elif val2 < val1:
	print('Second')
else:
	print('Friendship')


a = input()
b = [int(x) for x in a.split()]
p1 = 0 + b[1] * b[0] + b[3] * 2
p2 = 0 + b[2] * b[0] + b[4] * 2
if p1 > p2:
	print('Second')
elif p2 > p1:
	print('First')
else:
	print('Friendship')


t = [int(x) for x in input().split()]
f = t[0] * t[1] + 2 * t[3]
s = t[0] * t[2] + 2 * t[4]
if f < s:
	print('First')
elif s < f:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
(a, b) = (s * v1 + 2 * t1, s * v2 + 2 * t2)
print((('Second', 'First')[a < b], 'Friendship')[a == b])


list = input().split(' ')
for i in range(len(list)):
	list[i] = int(list[i])
p1 = list[0] * list[1] + 2 * list[3]
p2 = list[0] * list[2] + 2 * list[4]
if p2 > p1:
	print('First')
elif p1 > p2:
	print('Second')
else:
	print('Friendship')


(a, b, c, d, e) = map(int, input().split())
k = a * (c - b) + 2 * (e - d)
print('First' if k > 0 else 'Second' if k < 0 else 'Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
time1 = s * v1 + 2 * t1
time2 = s * v2 + 2 * t2
if time1 < time2:
	print('First')
elif time1 > time2:
	print('Second')
else:
	print('Friendship')


def tripleCond(L, R, s1='', s2='', s3=''):
	if L < R:
		return s1
	if L > R:
		return s2
	return s3
(s, v1, v2, t1, t2) = tuple(map(int, input().split()))
ans = tripleCond(s * v1 + t1 * 2, s * v2 + t2 * 2, 'First', 'Second', 'Friendship')
print(ans)


(s, a, b, c, d) = map(int, input().split())
t1 = s * a + 2 * c
t2 = s * b + 2 * d
if t1 < t2:
	print('First')
elif t1 > t2:
	print('Second')
else:
	print('Friendship')


n = list(map(int, input().split()))
a = n[0] * n[1] + 2 * n[3]
b = n[0] * n[2] + 2 * n[4]
if a < b:
	print('First')
if b < a:
	print('Second')
if b == a:
	print('Friendship')


n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
d = int(n[3])
e = int(n[4])
hasil1 = b * a + d * 2
hasil2 = c * a + e * 2
if hasil1 < hasil2:
	print('First')
elif hasil1 == hasil2:
	print('Friendship')
else:
	print('Second')


(s, v_1, v_2, t_1, t_2) = map(float, input().split())
if s * v_1 + 2 * t_1 < s * v_2 + 2 * t_2:
	print('First')
elif s * v_1 + 2 * t_1 > s * v_2 + 2 * t_2:
	print('Second')
else:
	print('Friendship')


(a, b, c, d, e) = map(int, input().split())
sm1 = sm2 = 0
sm1 = b * a + d * 2
sm2 = c * a + e * 2
if sm1 < sm2:
	print('First')
if sm1 > sm2:
	print('Second')
if sm1 == sm2:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())

def round_trip(ping):
	return ping * 2

def duration(ms, char):
	return ms * char
q1 = round_trip(t1) + duration(v1, s)
q2 = round_trip(t2) + duration(v2, s)
if q1 < q2:
	print('First')
elif q1 > q2:
	print('Second')
else:
	print('Friendship')


def signum(x):
	if x == 0:
		return 0
	if x > 0:
		return 1
	return -1
answers = {1: 'First', 0: 'Friendship', -1: 'Second'}
(s, v1, v2, t1, t2) = map(int, input().split())
time_first = 2 * t1 + v1 * s
time_second = 2 * t2 + v2 * s
k = signum(time_second - time_first)
print(answers[k])


import sys
str = input().split()
str = [int(a) for a in str]
x = str[0] * str[1] + 2 * str[3]
y = str[0] * str[2] + 2 * str[4]
if x < y:
	print('First')
elif y < x:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
p1 = s * v1 + t1
p2 = s * v2 + t2
ft1 = p1 + t1
ft2 = p2 + t2
if ft1 < ft2:
	print('First')
elif ft1 > ft2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = list(map(int, input().split()))
if s * v1 + 2 * t1 < s * v2 + 2 * t2:
	print('First')
if s * v1 + 2 * t1 > s * v2 + 2 * t2:
	print('Second')
if s * v1 + 2 * t1 == s * v2 + 2 * t2:
	print('Friendship')


(s, v1, v2, ping1, ping2) = map(int, input().split())
if v1 * s + 2 * ping1 == v2 * s + 2 * ping2:
	print('Friendship')
elif v1 * s + 2 * ping1 < v2 * s + 2 * ping2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
s1 = s * v1 + 2 * t1
s2 = s * v2 + 2 * t2
if s1 == s2:
	print('Friendship')
elif s1 < s2:
	print('First')
else:
	print('Second')


def main():
	(s, v1, v2, t1, t2) = [int(v) for v in input().split()]
	d1 = v1 * s + 2 * t1
	d2 = v2 * s + 2 * t2
	if d1 < d2:
		print('First')
	elif d1 > d2:
		print('Second')
	else:
		print('Friendship')
main()


(s, v1, v2, t1, t2) = map(int, input().split())
a1 = v1 * s + 2 * t1
a2 = v2 * s + 2 * t2
if a1 < a2:
	print('First')
elif a1 > a2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
(q, w) = (s * v1 + 2 * t1, s * v2 + 2 * t2)
if q < w:
	print('First')
elif q > w:
	print('Second')
else:
	print('Friendship')


import sys
inf = float('inf')
from math import ceil, floor, log, log2, sqrt, factorial, pow, pi, gcd

def powerMod(x, y):
	res = 1
	while y > 0:
		if y & 1:
			res = res * x
		y = y >> 1
		x = x * x
	return res
abc = 'abcdefghijklmnopqrstuvwxyz'
abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
(mod, MOD) = (1000000007, 998244353)
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def get_array():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def input():
	return sys.stdin.readline().strip()
(s, v1, v2, t1, t2) = get_ints()
z1 = s * v1 + 2 * t1
z2 = s * v2 + 2 * t2
if z1 > z2:
	print('Second')
elif z2 > z1:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split(' '))
arrival_1 = 2 * t1 + v1 * s
arrival_2 = 2 * t2 + v2 * s
if arrival_1 < arrival_2:
	print('First')
elif arrival_2 < arrival_1:
	print('Second')
else:
	print('Friendship')


x = input().split()
s = int(x[0])
v1 = int(x[1])
v2 = int(x[2])
t1 = int(x[3])
t2 = int(x[4])
ant1 = 0
ant2 = 0
ant1 = 2 * t1 + s * v1
ant2 = 2 * t2 + s * v2
if ant1 == ant2:
	print('Friendship')
elif ant1 < ant2:
	print('First')
else:
	print('Second')


(s, V1, V2, t1, t2) = map(int, input().split())
a = V1 * s + 2 * t1
b = V2 * s + 2 * t2
if a > b:
	print('Second')
elif b > a:
	print('First')
else:
	print('Friendship')


a = input().split(' ')
s = int(a[0])
v1 = int(a[1])
v2 = int(a[2])
t1 = int(a[3])
t2 = int(a[4])
first_time = s * v1 + 2 * t1
second_time = s * v2 + 2 * t2
if first_time < second_time:
	print('First')
elif second_time < first_time:
	print('Second')
else:
	print('Friendship')


x = input().split()
s = int(x[0])
v1 = int(x[1])
v2 = int(x[2])
t1 = int(x[3])
t2 = int(x[4])
s1 = s * v1 + 2 * t1
s2 = s * v2 + 2 * t2
if s1 < s2:
	print('First')
elif s1 > s2:
	print('Second')
else:
	print('Friendship')


f = lambda s, v, t: s * v + 2 * t
(s, v1, v2, t1, t2) = map(int, input().split())
(f1, f2) = (f(s, v1, t1), f(s, v2, t2))
print('First' if f1 < f2 else 'Second' if f1 > f2 else 'Friendship')


b = []
for a in input().split():
	b.append(int(a))
t1 = b[0] * b[1] + 2 * b[3]
t2 = b[0] * b[2] + 2 * b[4]
if t1 < t2:
	print('First')
elif t1 == t2:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
sum1 = t1 + v1 * s + t1
sum2 = t2 + v2 * s + t2
if sum1 < sum2:
	print('First')
elif sum2 < sum1:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
time_a = 2 * t1 + s * v1
time_b = 2 * t2 + s * v2
if time_a < time_b:
	print('First')
elif time_a > time_b:
	print('Second')
else:
	print('Friendship')


I = input().split()
I = [int(i) for i in I]
S = I[0]
v1 = I[1]
v2 = I[2]
t1 = I[3]
t2 = I[4]
if S * v1 + 2 * t1 < S * v2 + 2 * t2:
	print('First')
elif S * v1 + 2 * t1 > S * v2 + 2 * t2:
	print('Second')
else:
	print('Friendship')


x = list(map(int, input().split()))
first = x[0] * x[1] + 2 * x[3]
second = x[0] * x[2] + 2 * x[4]
if first < second:
	print('First')
elif second < first:
	print('Second')
elif first == second:
	print('Friendship')


(a, b, c, d, e) = map(int, input().split())
f = d + b * a + d
g = e + c * a + e
if f < g:
	print('First')
elif g < f:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
an1 = s * v1 + 2 * t1
an2 = s * v2 + 2 * t2
if an1 < an2:
	print('First')
elif an2 < an1:
	print('Second')
else:
	print('Friendship')


def r():
	return list(map(int, input().split()))
(s, v1, v2, t1, t2) = r()
if s * v1 + t1 * 2 < s * v2 + t2 * 2:
	print('First')
elif s * v1 + t1 * 2 > s * v2 + t2 * 2:
	print('Second')
else:
	print('Friendship')


import math
from collections import *
import sys
from functools import reduce

def get_ints():
	return map(int, input().strip().split())

def get_list():
	return list(get_ints())

def get_string():
	return list(input().strip().split())

def printxsp(*args):
	return print(*args, end='')

def printsp(*args):
	return print(*args, end=' ')
UGLYMOD = int(1000000000.0) + 7
SEXYMOD = 998244353
MAXN = int(100000.0)
(n, v1, v2, p1, p2) = get_ints()
e1 = p1 + n * v1 + p1
e2 = p2 + n * v2 + p2
if e1 == e2:
	print('Friendship')
else:
	print('First' if e1 < e2 else 'Second')


(s, v1, v2, t1, t2) = input().split()
s = int(s)
v1 = int(v1)
v2 = int(v2)
t1 = int(t1)
t2 = int(t2)
q1 = t1 * 2 + s * v1
q2 = t2 * 2 + s * v2
if q1 == q2:
	print('Friendship')
elif q1 < q2:
	print('First')
elif q1 > q2:
	print('Second')


def typecontest(s, v1, v2, t1, t2):
	Firsttakes = v1 * s + 2 * t1
	Secondtakes = v2 * s + 2 * t2
	if Firsttakes < Secondtakes:
		print('First')
	elif Firsttakes > Secondtakes:
		print('Second')
	else:
		print('Friendship')
	return
(s, v1, v2, t1, t2) = list(map(int, input().strip().split()))
typecontest(s, v1, v2, t1, t2)


a = input().split()
a = list(map(int, a))
a1 = a[0] * a[1] + 2 * a[3]
a2 = a[0] * a[2] + 2 * a[4]
if a1 == a2:
	print('Friendship')
elif a1 < a2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
total1 = t1 * 2 + s * v1
total2 = t2 * 2 + s * v2
print('Friendship' if total1 == total2 else 'First' if total1 < total2 else 'Second')


def common_time(s, v, t):
	return t * 2 + v * s

def main():

	def list_from_input():
		return list(map(int, input().split()))
	(s, v1, v2, t1, t2) = list_from_input()
	time1 = common_time(s, v1, t1)
	time2 = common_time(s, v2, t2)
	if time1 == time2:
		print('Friendship')
	elif time1 < time2:
		print('First')
	else:
		print('Second')
main()


(s, a, b, x, y) = map(int, input().split())
(A, B) = (2 * x + a * s, 2 * y + b * s)
print('First' if A < B else 'Second' if A > B else 'Friendship')


values = str(input(''))
valuesSplit = str.split(values)
words = int(valuesSplit[0])
p1WPS = int(valuesSplit[1])
p2WPS = int(valuesSplit[2])
p1Ping = int(valuesSplit[3])
p2Ping = int(valuesSplit[4])
p1Time = p1WPS * words + p1Ping * 2
p2Time = p2WPS * words + p2Ping * 2
if p1Time > p2Time:
	print('Second')
elif p1Time < p2Time:
	print('First')
else:
	print('Friendship')


from math import pow
(s, v1, v2, t1, t2) = map(int, input().split())
p1 = s * v1 + 2 * t1
p2 = s * v2 + 2 * t2
if p1 < p2:
	print('First')
if p1 > p2:
	print('Second')
if p1 == p2:
	print('Friendship')


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	(s, v1, v2, t1, t2) = LI()
	a1 = s * v1 + t1 * 2
	a2 = s * v2 + t2 * 2
	if a1 == a2:
		return 'Friendship'
	if a1 < a2:
		return 'First'
	return 'Second'
print(main())


inp = input().split()
a = int(inp[0])
b = int(inp[1])
c = int(inp[2])
d = int(inp[3])
e = int(inp[4])
f = a * b + 2 * d
g = a * c + 2 * e
if f < g:
	print('First')
elif g < f:
	print('Second')
else:
	print('Friendship')


l = [int(i) for i in input().split()]
a = l[0] * l[1] + l[3] * 2
b = l[0] * l[2] + l[4] * 2
if a < b:
	print('First')
elif b < a:
	print('Second')
else:
	print('Friendship')


import sys
(s, v1, v2, t1, t2) = list(map(int, input().split()))
tt1 = v1 * s + 2 * t1
tt2 = v2 * s + 2 * t2
if tt1 < tt2:
	print('First')
elif tt1 == tt2:
	print('Friendship')
else:
	print('Second')


(s, x, y, a, b) = map(int, input().split())
xx = 2 * a + s * x
yy = 2 * b + s * y
if xx < yy:
	print('First')
elif xx > yy:
	print('Second')
else:
	print('Friendship')


def F(T):
	(s, v1, v2, t1, t2) = T
	(a, b) = (s * v1 + 2 * t1, s * v2 + 2 * t2)
	if a == b:
		return 'Friendship'
	elif a < b:
		return 'First'
	else:
		return 'Second'
print(F((int(t) for t in input().split(' '))))


(s, v1, v2, t1, t2) = map(int, input().split())
uno = s * v1 + 2 * t1
dos = s * v2 + 2 * t2
if uno < dos:
	print('First')
elif dos < uno:
	print('Second')
else:
	print('Friendship')


a = list(map(int, input().split()))
per1 = a[0] * a[1] + 2 * a[3]
per2 = a[0] * a[2] + 2 * a[4]
if per1 < per2:
	print('First')
elif per1 > per2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
ping1 = 2 * t1 + s * v1
ping2 = 2 * t2 + s * v2
difference = ping1 - ping2
if difference == 0:
	print('Friendship')
elif difference > 0:
	print('Second')
elif difference < 0:
	print('First')


def time(s, v, t):
	times = 2 * t + s * v
	return times
data = input().split()
s = int(data[0])
v1 = int(data[1])
v2 = int(data[2])
t1 = int(data[3])
t2 = int(data[4])
time1 = time(s, v1, t1)
time2 = time(s, v2, t2)
if time1 < time2:
	print('First')
elif time1 > time2:
	print('Second')
elif time1 == time2:
	print('Friendship')


def ii():
	return int(input())

def fi():
	return float(input())

def si():
	return input()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
import math
(s, v1, v2, t1, t2) = mi()
d = s * (v1 - v2) + 2 * (t1 - t2)
if d < 0:
	ans = 'First'
elif d > 0:
	ans = 'Second'
else:
	ans = 'Friendship'
print(ans)


(s, v1, v2, t1, t2) = map(int, input().split())
svt1 = v1 * s + 2 * t1
svt2 = v2 * s + 2 * t2
if svt1 < svt2:
	print('First')
elif svt1 > svt2:
	print('Second')
else:
	print('Friendship')


def str_list(s, char):
	output_list = []
	collector = ''
	for i in range(len(s)):
		if s[i] == char:
			if collector:
				output_list.append(int(collector))
				collector = ''
		else:
			collector += s[i]
	output_list.append(int(collector))
	return output_list

def str_list_with_str(s, char):
	output_list = []
	collector = ''
	for i in range(len(s)):
		if s[i] == char:
			if collector:
				output_list.append(collector)
				collector = ''
		else:
			collector += s[i]
	output_list.append(collector)
	return output_list

def list_str(l, char):
	output_str = ''
	for i in range(len(l) - 1):
		output_str += str(l[i]) + char
	output_str += str(l[len(l) - 1])
	return output_str

def main_function():
	(s, v_1, v_2, t_1, t_2) = str_list(input(), ' ')
	if 2 * t_1 + s * v_1 < 2 * t_2 + s * v_2:
		return 'First'
	elif 2 * t_1 + s * v_1 > 2 * t_2 + s * v_2:
		return 'Second'
	else:
		return 'Friendship'
print(main_function())


(s, v1, v2, t1, t2) = map(int, input().split())
ans = s * (v2 - v1) + 2 * (t2 - t1)
print(['Friendship', 'First', 'Second'][ans // max(abs(ans), 1)])


(s, v1, v2, t1, t2) = list(map(int, input().split()))
res1 = 2 * t1 + s * v1
res2 = 2 * t2 + s * v2
if res1 == res2:
	print('Friendship')
else:
	print('First' if res1 < res2 else 'Second')


(s, v1, v2, t1, t2) = map(int, input().split())
p1 = 2 * t1 + s * v1
p2 = 2 * t2 + s * v2
d = p1 - p2
if d > 0:
	print('Second')
elif d < 0:
	print('First')
else:
	print('Friendship')


entrada = str(input())
entrada = entrada.split()
s = int(entrada[0])
v1 = int(entrada[1])
v2 = int(entrada[2])
t1 = int(entrada[3])
t2 = int(entrada[4])
ans = 'Friendship'
one = 2 * t1 + s * v1
two = 2 * t2 + s * v2
if one < two:
	ans = 'First'
elif one > two:
	ans = 'Second'
print(ans)


from math import ceil, log, floor, sqrt
import math
k = 1

def mod_expo(n, p, m):
	result = 1
	while p != 0:
		if p % 2 == 1:
			result = result * n % m
		p //= 2
		n = n * n % m
	return result

def is_prime(n):
	m = 2
	while m * m <= n:
		if n % m == 0:
			return False
		m += 1
	return True

def find_sum(n, a):
	a.insert(0, 0)
	for i in range(1, n + 1):
		prev = a[i] & a[i - 1]
		cur = a[i] | a[i - 1]
		a[i - 1] = prev
		a[i] = cur
	return sum((m * m for m in a))

def prin_abc(x, y, z):
	l = [x, y, z]
	l.sort()
	if l[1] < l[2]:
		print('NO')
		return
	a = b = l[0]
	c = l[2]
	print('YES')
	print(a, b, c)

def get_scores(n, vals):
	l = 0
	r = n - 1
	turn = 0
	sereja = 0
	dima = 0
	while l <= r:
		if vals[l] > vals[r]:
			cur = vals[l]
			l += 1
		else:
			cur = vals[r]
			r -= 1
		if turn == 0:
			sereja += cur
		else:
			dima += cur
		turn = not turn
	print(sereja, dima)

def count_lamps(n, m):
	return (n * m + 1) // 2

def find_winner(s, v1, v2, t1, t2):
	first = s * v1 + 2 * t1
	second = s * v2 + 2 * t2
	if first == second:
		return 'Friendship'
	if first < second:
		return 'First'
	return 'Second'
t = 1
while t:
	t = t - 1
	(k, g) = (0, 0)
	points = []
	(s, v1, v2, t1, t2) = map(int, input().split())
	print(find_winner(s, v1, v2, t1, t2))


inp = input().split(' ')
s = int(inp[0])
v1 = int(inp[1])
v2 = int(inp[2])
t1 = int(inp[3])
t2 = int(inp[4])
result1 = t1 * 2 + s * v1
result2 = t2 * 2 + s * v2
if result1 < result2:
	print('First')
elif result1 > result2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
r1 = s * v1 + 2 * t1
r2 = s * v2 + 2 * t2
if r1 == r2:
	print('Friendship')
elif r1 < r2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
member1 = t1 + s * v1 + t1
member2 = t2 + s * v2 + t2
if member1 == member2:
	print('Friendship')
elif member1 < member2:
	print('First')
else:
	print('Second')


n = [int(i) for i in input().split()]
if n[1] * n[0] + 2 * n[3] < n[2] * n[0] + 2 * n[4]:
	print('First')
elif n[1] * n[0] + 2 * n[3] > n[2] * n[0] + 2 * n[4]:
	print('Second')
else:
	print('Friendship')


(s, p1, p2, t1, t2) = map(int, input().split())
a = s * p1 + 2 * t1
b = s * p2 + 2 * t2
if a < b:
	print('First')
elif b < a:
	print('Second')
else:
	print('Friendship')


(t, v1, v2, t1, t2) = [int(x) for x in input().split()]
ta = 2 * t1 + v1 * t
tb = 2 * t2 + v2 * t
if ta < tb:
	print('First')
elif ta == tb:
	print('Friendship')
else:
	print('Second')


(_, v1, v2, t1, t2) = tuple(map(int, input().split()))
k1 = _ * v1 + t1 * 2
k2 = _ * v2 + t2 * 2
if k1 < k2:
	print('First')
elif k2 < k1:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, p1, p2) = map(int, input().strip().split(' '))
a = s * v1 + 2 * p1
b = s * v2 + 2 * p2
if a < b:
	print('First')
elif b < a:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
a1 = s * v1 + 2 * t1
a2 = s * v2 + 2 * t2
if a1 < a2:
	print('First')
elif a2 < a1:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(a) for a in input().split()]
time1 = s * v1 + 2 * t1
time2 = s * v2 + 2 * t2
if time1 < time2:
	print('First')
elif time1 > time2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
ans1 = 2 * t1 + s * v1
ans2 = 2 * t2 + s * v2
if ans1 < ans2:
	print('First')
elif ans1 > ans2:
	print('Second')
else:
	print('Friendship')


holder = []
x = input('')
holder = x.split(' ')
First = int(holder[0]) * int(holder[1]) + int(holder[3]) * 2
Second = int(holder[0]) * int(holder[2]) + int(holder[4]) * 2
if First == Second:
	print('Friendship')
elif First < Second:
	print('First')
else:
	print('Second')


(s, n, m, a, b) = map(int, input().split())
if s * n + 2 * a < s * m + 2 * b:
	print('First')
elif s * n + 2 * a > s * m + 2 * b:
	print('Second')
else:
	print('Friendship')


data = input().split()
int_data = list(map(int, data))
if int_data[1] * int_data[0] + 2 * int_data[3] > int_data[2] * int_data[0] + 2 * int_data[4]:
	print('Second')
elif int_data[1] * int_data[0] + 2 * int_data[3] < int_data[2] * int_data[0] + 2 * int_data[4]:
	print('First')
elif int_data[1] * int_data[0] + 2 * int_data[3] == int_data[2] * int_data[0] + 2 * int_data[4]:
	print('Friendship')


from sys import stdin, stdout
(s, v1, v2, t1, t2) = [int(x) for x in stdin.readline().strip().split()]
ans = ['First', 'Second', 'Friendship']
one = 2 * t1 + s * v1
two = 2 * t2 + s * v2
if one < two:
	stdout.write(ans[0])
elif one > two:
	stdout.write(ans[1])
else:
	stdout.write(ans[2])


import sys, math
input = sys.stdin.readline
L = lambda : list(map(int, input().split()))
M = lambda : map(int, input().split())
(s, v1, v2, t1, t2) = M()
if s * v1 + 2 * t1 < s * v2 + 2 * t2:
	print('First')
elif s * v1 + 2 * t1 > s * v2 + 2 * t2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
mish = s * v1 + 2 * t1
vas = s * v2 + 2 * t2
if mish > vas:
	print('Second')
elif mish == vas:
	print('Friendship')
else:
	print('First')


(s, v1, v2, t1, t2) = map(int, input().split())
player1 = s * v1 + t1 * 2
player2 = s * v2 + t2 * 2
if player1 < player2:
	print('First')
elif player2 < player1:
	print('Second')
else:
	print('Friendship')


m = [int(x) for x in input().split()]
a = m[0] * m[1] + 2 * m[3]
b = m[0] * m[2] + 2 * m[4]
if a < b:
	print('First')
elif a > b:
	print('Second')
elif a == b:
	print('Friendship')


(k, p1, p2, q1, q2) = map(int, input().split())
if k * p1 + 2 * q1 < k * p2 + 2 * q2:
	print('First')
elif k * p1 + 2 * q1 > k * p2 + 2 * q2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = (int(x) for x in input().split())
first = 2 * t1 + s * v1
sec = 2 * t2 + s * v2
if first == sec:
	print('Friendship')
elif first > sec:
	print('Second')
else:
	print('First')


import math, sys, bisect, heapq
from collections import defaultdict, Counter, deque
from itertools import groupby, accumulate
int1 = lambda x: int(x) - 1
ilele = lambda : map(int, input().split())
alele = lambda : list(map(int, input().split()))
ilelec = lambda : map(int1, input().split())
alelec = lambda : list(map(int1, input().split()))

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def Y(c):
	print(['NO', 'YES'][c])

def y(c):
	print(['no', 'yes'][c])

def Yy(c):
	print(['No', 'Yes'][c])
(s, v1, v2, t1, t2) = ilele()
a = s * v1 + 2 * t1
b = s * v2 + 2 * t2
if a > b:
	print('Second')
elif a < b:
	print('First')
else:
	print('Friendship')


def f(s, u, v, r, t):
	if s * u + 2 * r < s * v + 2 * t:
		return 'First'
	if s * u + 2 * r == s * v + 2 * t:
		return 'Friendship'
	else:
		return 'Second'
(s, u, v, r, t) = map(int, input().split())
print(f(s, u, v, r, t))


G = [j for j in input().split(' ')]
if float(G[0]) * float(G[1]) + 2 * float(G[3]) < float(G[0]) * float(G[2]) + 2 * float(G[4]):
	print('First')
elif float(G[0]) * float(G[1]) + 2 * float(G[3]) > float(G[0]) * float(G[2]) + 2 * float(G[4]):
	print('Second')
else:
	print('Friendship')


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
(s, v1, v2, t1, t2) = invr()
w1 = 2 * t1 + v1 * s
w2 = 2 * t2 + v2 * s
if w1 < w2:
	print('First')
elif w1 > w2:
	print('Second')
else:
	print('Friendship')


(a, b, c, d, e) = [int(x) for x in input().split()]
x = a * b + 2 * d
y = a * c + 2 * e
if x < y:
	print('First')
elif y < x:
	print('Second')
else:
	print('Friendship')


(t, a, b, a1, b1) = map(int, input().split())
x = a * t + 2 * a1
y = b * t + 2 * b1
if x > y:
	print('Second')
elif y > x:
	print('First')
else:
	print('Friendship')


from sys import stdin
(s, v1, v2, t1, t2) = [int(i) for i in stdin.readline().split(' ')]
work1 = t1 + s * v1 + t1
work2 = t2 + s * v2 + t2
if work1 < work2:
	print('First')
elif work1 > work2:
	print('Second')
else:
	print('Friendship')


(text_lenght, speed_1, speed_2, time_1, time_2) = map(int, input().split())
total_time_1 = time_1 + text_lenght * speed_1 + time_1
total_time_2 = time_2 + text_lenght * speed_2 + time_2
if total_time_1 < total_time_2:
	print('First')
else:
	if total_time_1 > total_time_2:
		print('Second')
	if total_time_1 == total_time_2:
		print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
res = s * v1 + 2 * t1 - (s * v2 + 2 * t2)
print(('First', 'Second', 'Friendship')[(res == 0) * 2 or res > 0])


import sys

def main():
	(s, v1, v2, t1, t2) = map(int, sys.stdin.readline().split())
	a1 = t1 * 2 + v1 * s
	a2 = t2 * 2 + v2 * s
	if a1 < a2:
		print('First')
	elif a2 < a1:
		print('Second')
	else:
		print('Friendship')
main()


(s, v1, v2, t1, t2) = map(int, input().split())
w1 = s * v1 + 2 * t1
w2 = s * v2 + 2 * t2
if w1 < w2:
	print('First')
elif w2 < w1:
	print('Second')
else:
	print('Friendship')


l = list(map(int, input().split()))
p1 = l[0] * l[1] + 2 * l[-2]
p2 = l[0] * l[2] + 2 * l[-1]
if p1 == p2:
	print('Friendship')
else:
	print('First' if p1 < p2 else 'Second')


(n, a, x, b, y) = map(int, input().split())
t1 = a * n + 2 * b
t2 = x * n + 2 * y
if t1 < t2:
	print('First\n')
elif t1 > t2:
	print('Second\n')
else:
	print('Friendship\n')


(s, v1, v2, t1, t2) = list(map(int, input().split()))
l1 = (t1 << 1) + s * v1
l2 = (t2 << 1) + s * v2
if l1 == l2:
	print('Friendship')
elif l1 < l2:
	print('First')
else:
	print('Second')


lis = input()
lis = lis.split()
if int(lis[0]) * int(lis[1]) + int(lis[-2]) * 2 < int(lis[0]) * int(lis[2]) + int(lis[-1]) * 2:
	print('First')
elif int(lis[0]) * int(lis[1]) + int(lis[-2]) * 2 > int(lis[0]) * int(lis[2]) + int(lis[-1]) * 2:
	print('Second')
else:
	print('Friendship')


line = input().split(' ')
(s, v1, v2, t1, t2) = line
s = int(s)
v1 = int(v1)
v2 = int(v2)
t1 = int(t1)
t2 = int(t2)
p1 = s * v1 + t1 * 2
p2 = s * v2 + t2 * 2
if p1 == p2:
	print('Friendship')
elif p1 > p2:
	print('Second')
elif p1 < p2:
	print('First')


p1 = 'First'
p2 = 'Second'
dr = 'Friendship'
(s, v1, v2, t1, t2) = [int(x) for x in input().split(' ')]
p1_t = s * v1 + 2 * t1
p2_t = s * v2 + 2 * t2
if p1_t < p2_t:
	print(p1)
elif p2_t < p1_t:
	print(p2)
else:
	print(dr)


(s, a, b, a1, b1) = map(int, input().split())
a = s * a + 2 * a1
b = s * b + 2 * b1
if b > a:
	print('First')
elif a > b:
	print('Second')
else:
	print('Friendship')


x = str(input())
don = x.split(' ')
for i in range(0, len(don)):
	don[i] = int(don[i])
fir = don[3] * 2 + don[0] * don[1]
sec = don[4] * 2 + don[0] * don[2]
if fir < sec:
	print('First')
elif sec == fir:
	print('Friendship ')
else:
	print('Second')


lt = list(map(int, input().split()))
f = lt[0] * lt[1] + 2 * lt[3]
s = lt[0] * lt[2] + 2 * lt[4]
if f < s:
	print('First')
elif f > s:
	print('Second')
else:
	print('Friendship')


x = [int(x) for x in input().split()]
first = x[0] * x[1] + 2 * x[3]
second = x[0] * x[2] + 2 * x[4]
if first > second:
	print('Second')
elif first < second:
	print('First')
elif first == second:
	print('Friendship')


(a, b, c, d, e) = map(int, input().split())
x = 2 * e + a * c
y = 2 * d + a * b
if x < y:
	print('Second')
if x > y:
	print('First')
if x == y:
	print('Friendship')


import sys
from sys import stdin, stdout
import bisect
import math
import heapq

def modinv(n, p):
	return pow(n, p - 2, p)

def cin():
	return map(int, sin().split())

def ain():
	return list(map(int, sin().split()))

def sin():
	return input()

def inin():
	return int(input())
import math

def Divisors(n):
	l = []
	for i in range(1, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n // i == i:
				l.append(i)
			else:
				l.append(i)
				l.append(n // i)
	return l

def most_frequent(list):
	return max(set(list), key=list.count)

def main():
	a = ain()
	s = a[0]
	v1 = a[1]
	v2 = a[2]
	t1 = a[3]
	t2 = a[4]
	sum1 = 0
	sum2 = 0
	sum1 = 2 * t1 + s * v1
	sum2 = 2 * t2 + s * v2
	if sum1 == min(sum1, sum2) and sum1 != sum2:
		print('First')
	elif sum2 == min(sum1, sum2) and sum1 != sum2:
		print('Second')
	else:
		print('Friendship')
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
import sys

class ostream:

	def __lshift__(self, a):
		sys.stdout.write(str(a))
		return self
cout = ostream()
endl = '\n'

def readnumbers(zero=0):
	conv = ord if py2 else lambda x: x
	A = []
	numb = zero
	sign = 1
	i = 0
	s = sys.stdin.buffer.read()
	try:
		while True:
			if s[i] >= b'0'[0]:
				numb = 10 * numb + conv(s[i]) - 48
			elif s[i] == b'-'[0]:
				sign = -1
			elif s[i] != b'\r'[0]:
				A.append(sign * numb)
				numb = zero
				sign = 1
			i += 1
	except:
		pass
	if s and s[-1] >= b'0'[0]:
		A.append(sign * numb)
	return A
main()


vals = input().strip()
s = int(vals.split()[0])
v1 = int(vals.split()[1])
v2 = int(vals.split()[2])
t1 = int(vals.split()[3])
t2 = int(vals.split()[4])
first = 2 * t1 + s * v1
second = 2 * t2 + s * v2
if first < second:
	print('First')
elif first > second:
	print('Second')
else:
	print('Friendship')


(string, f_s, s_s, f_d, s_d) = map(int, input().split())
first = 2 * f_d + string * f_s
second = 2 * s_d + string * s_s
if first < second:
	print('First')
elif second < first:
	print('Second')
else:
	print('Friendship')


x = list(map(int, input().split()))
timeone = x[1] * x[0] + 2 * x[3]
timetwo = x[2] * x[0] + 2 * x[4]
if timeone > timetwo:
	print('Second')
elif timetwo > timeone:
	print('First')
elif timeone == timetwo:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
if s * v1 + t1 * 2 > s * v2 + t2 * 2:
	print('Second')
	exit()
elif s * v1 + t1 * 2 < s * v2 + t2 * 2:
	print('First')
	exit()
print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
fr = s * v1 + 2 * t1
sc = s * v2 + 2 * t2
if fr < sc:
	print('First')
elif fr > sc:
	print('Second')
else:
	print('Friendship')


(s, a1, a2, b1, b2) = map(int, input().split())
x1 = a1 * s + 2 * b1
x2 = a2 * s + 2 * b2
if x1 > x2:
	print('Second')
elif x1 == x2:
	print('Friendship')
else:
	print('First')


lst = list(map(int, input().split()))
a = lst[0] * lst[1] + 2 * lst[3]
b = lst[0] * lst[2] + 2 * lst[4]
if a < b:
	print('First')
elif b < a:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
ss = s * v1 + 2 * t1
sss = s * v2 + 2 * t2
if ss < sss:
	print('First')
if ss > sss:
	print('Second')
if ss == sss:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
total1 = v1 * s + 2 * t1
total2 = v2 * s + 2 * t2
if total1 < total2:
	print('First')
elif total2 < total1:
	print('Second')
else:
	print('Friendship')


import time

def calculateWinner(lenS, first_tps, sec_tps, first_ping, sec_ping):
	winner = ''
	first_ttime = lenS * first_tps + 2 * first_ping
	sec_ttime = lenS * sec_tps + 2 * sec_ping
	if first_ttime < sec_ttime:
		winner = 'First'
	elif first_ttime > sec_ttime:
		winner = 'Second'
	else:
		winner = 'Friendship'
	return winner

def solve():
	(lenS, first_tps, sec_tps, first_ping, sec_ping) = [int(x) for x in input().split()]
	print(calculateWinner(lenS, first_tps, sec_tps, first_ping, sec_ping))
solve()


def keyRaces(s, v1, v2, t1, t2):
	first = s * v1 + 2 * t1
	second = s * v2 + 2 * t2
	if first < second:
		return 'First'
	elif first > second:
		return 'Second'
	else:
		return 'Friendship'
s = [int(n) for n in input().split()]
print(keyRaces(s[0], s[1], s[2], s[3], s[4]))


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def I():
	return int(sys.stdin.readline())

def LS():
	return sys.stdin.readline().split()

def S():
	return input()

def main():
	(a, b, c, d, e) = LI()
	x = a * b + 2 * d
	y = a * c + 2 * e
	if x == y:
		return 'Friendship'
	elif x < y:
		return 'First'
	return 'Second'
print(main())


n1 = input()
arr = n1.split()
word = int(arr[0])
s1 = int(arr[1])
s2 = int(arr[2])
ping1 = int(arr[3])
ping2 = int(arr[4])
t1 = s1 * word + 2 * ping1
t2 = s2 * word + 2 * ping2
if t1 == t2:
	print('Friendship')
elif t1 < t2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
res = 2 * t1 + v1 * s - (2 * t2 + v2 * s)
if res == 0:
	print('Friendship')
elif res < 0:
	print('First')
else:
	print('Second')


inp = input().split()
s = int(inp[0])
v1 = int(inp[1])
v2 = int(inp[2])
t1 = int(inp[3])
t2 = int(inp[4])
total_one = 2 * t1 + s * v1
total_two = 2 * t2 + s * v2
if total_one == total_two:
	print('Friendship')
elif total_one > total_two:
	print('Second')
else:
	print('First')


(a, b, c, d, e) = input('').split(' ')
s = int(a)
v1 = int(b)
v2 = int(c)
t1 = int(d)
t2 = int(e)
j = s * v1 + t1 * 2
k = s * v2 + t2 * 2
if j < k:
	print('First')
elif j > k:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split(' '))
value1 = v1 * s + t1 + t1
value2 = v2 * s + t2 + t2
if value1 < value2:
	print('First')
elif value1 > value2:
	print('Second')
else:
	print('Friendship')


args = input().split()
args = [eval(i) for i in args]
t1 = args[0] * args[1] + args[3] * 2
t2 = args[0] * args[2] + args[4] * 2
if t1 < t2:
	print('First')
elif t2 < t1:
	print('Second')
else:
	print('Friendship')


T = [int(x) for x in input().split()]
x = T[0] * T[1] + 2 * T[3]
y = T[0] * T[2] + 2 * T[4]
if x < y:
	print('First')
elif x > y:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = (int(x) for x in input().split())
T1 = 2 * t1 + s * v1
T2 = 2 * t2 + s * v2
if T1 < T2:
	print('First')
elif T1 > T2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
tim1 = s * v1 + 2 * t1
tim2 = s * v2 + 2 * t2
if tim1 > tim2:
	print('Second')
elif tim1 < tim2:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
x = s * v1 + 2 * t1
y = s * v2 + 2 * t2
if x < y:
	print('First')
elif y < x:
	print('Second')
else:
	print('Friendship')


(c, v1, v2, t1, t2) = map(int, input().split())
first = c * v1 + 2 * t1
second = c * v2 + 2 * t2
if first < second:
	print('First')
if first > second:
	print('Second')
if first == second:
	print('Friendship')


a = input()
b = []
b = a.split(' ')
z = len(b)
while z > 0:
	if int(b[z - 1]) > 1000:
		b = []
		a = input()
		b = a.split()
	z = z - 1
c = int(b[0]) * int(b[1]) + 2 * int(b[3])
d = int(b[0]) * int(b[2]) + 2 * int(b[4])
if c > d:
	print('Second')
elif c < d:
	print('First')
elif c == d:
	print('Friendship')


(s, v, u, t, o) = [int(i) for i in input().split()]
if s * v + 2 * t > s * u + 2 * o:
	print('Second')
elif s * v + 2 * t == s * u + 2 * o:
	print('Friendship')
else:
	print('First')


(a, b, c, d, e) = tuple(input().split())
a = int(a)
b = int(b)
c = int(c)
d = int(d)
e = int(e)
g = a * b + 2 * d
h = a * c + 2 * e
if g < h:
	print('First')
elif g > h:
	print('Second')
else:
	print('Friendship')


s = [*map(int, input().split())]
print('First' if s[0] * s[1] + s[3] * 2 < s[0] * s[2] + s[4] * 2 else 'Second' if s[0] * s[1] + s[3] * 2 > s[0] * s[2] + s[4] * 2 else 'Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()[:5]]
x1 = s * v1 + t1 + t1
x2 = s * v2 + t2 + t2
if x1 > x2:
	print('Second')
elif x1 < x2:
	print('First')
else:
	print('Friendship')


(s, a, b, t1, t2) = map(int, input().split())
s1 = s * a + 2 * t1
s2 = s * b + 2 * t2
if s1 > s2:
	print('Second')
elif s2 > s1:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
total_time_first = t1 + v1 * s + t1
total_time_second = t2 + v2 * s + t2
if total_time_first > total_time_second:
	print('Second')
elif total_time_first < total_time_second:
	print('First')
else:
	print('Friendship')


results = []
numbers = input('')
results = numbers.split()
s = int(results[0])
v1 = int(results[1])
v2 = int(results[2])
t1 = int(results[3])
t2 = int(results[4])
timewrite1 = s * v1
timewrite2 = s * v2
racer1 = timewrite1 + t1 + t1
racer2 = timewrite2 + t2 + t2
if racer1 > racer2:
	print('Second')
if racer2 > racer1:
	print('First')
if racer1 == racer2:
	print('Friendship')


(s, v1, v2, t1, t2) = (int(x) for x in input().split())
(x1, x2) = (2 * t1 + s * v1, 2 * t2 + s * v2)
if x1 < x2:
	print('First')
elif x1 == x2:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = (int(v) for v in input().split())
if v1 * s + 2 * t1 < v2 * s + 2 * t2:
	print('First')
elif v1 * s + 2 * t1 > v2 * s + 2 * t2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
time_one = s * v1 + 2 * t1
time_two = s * v2 + 2 * t2
if time_one > time_two:
	print('Second')
elif time_two > time_one:
	print('First')
else:
	print('Friendship')


l = list(map(int, input().split()))
s = l[0]
v1 = l[1]
v2 = l[2]
t1 = l[3]
t2 = l[4]
sf = s * v1 + 2 * t1
ss = s * v2 + 2 * t2
if sf < ss:
	print('First')
elif ss < sf:
	print('Second')
elif sf == ss:
	print('Friendship')


(charSum, oneV1, twoV1, oneV2, twoV2) = map(int, input().strip().split())
first = charSum * oneV1 + oneV2 * 2
second = charSum * twoV1 + twoV2 * 2
if first < second:
	print('First')
elif first > second:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
value1 = 2 * t1 + v1 * s
value2 = 2 * t2 + v2 * s
if value1 == value2:
	print('Friendship')
elif value1 < value2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = input().split()
if int(t1) + int(v1) * int(s) + int(t1) > int(t2) + int(v2) * int(s) + int(t2):
	print('Second')
elif int(t1) + int(v1) * int(s) + int(t1) < int(t2) + int(v2) * int(s) + int(t2):
	print('First')
else:
	print('Friendship')


l = list(map(int, input().split()))
(text, s1, s2, t1, t2) = (l[0], l[1], l[2], l[3], l[4])
(f, s) = (t1 * 2 + s1 * text, t2 * 2 + s2 * text)
if f < s:
	print('First')
elif s < f:
	print('Second')
else:
	print('Friendship')


qwerty = [int(i) for i in input().split()]
s = qwerty[0]
v1 = qwerty[1]
v2 = qwerty[2]
t1 = qwerty[3]
t2 = qwerty[4]
g1 = t1 * 2 + v1 * s
g2 = t2 * 2 + v2 * s
if g1 < g2:
	print('First')
elif g2 < g1:
	print('Second')
elif g1 == g2:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
ms = 2 * t1 + s * v1 - 2 * t2 - s * v2
print(['Friendship', 'First', 'Second'][(1 if ms < 0 else 2) if ms else 0])


(s, v1, v2, t1, t2) = map(int, input().split())
example_1 = 2 * t1 + s * v1
example_2 = 2 * t2 + s * v2
if example_1 > example_2:
	print('Second')
elif example_1 < example_2:
	print('First')
else:
	print('Friendship')


(n, v1, v2, t1, t2) = map(int, input().split())
count1 = n * v1 + 2 * t1
count2 = n * v2 + 2 * t2
if count1 == count2:
	print('Friendship')
elif count1 < count2:
	print('First')
else:
	print('Second')


def getWiner(args):
	first = int(args[0]) * int(args[1]) + int(args[3]) * 2
	second = int(args[0]) * int(args[2]) + int(args[4]) * 2
	return 'First' if first < second else 'Second' if second < first else 'Friendship'
print(getWiner(input().split(' ')))


import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *

class Scanner:

	@staticmethod
	def int():
		return int(sys.stdin.readline().rstrip())

	@staticmethod
	def string():
		return sys.stdin.readline().rstrip()

	@staticmethod
	def map_int():
		return [int(x) for x in Scanner.string().split()]

	@staticmethod
	def string_list(n):
		return [input() for i in range(n)]

	@staticmethod
	def int_list_list(n):
		return [Scanner.map_int() for i in range(n)]

	@staticmethod
	def int_cols_list(n):
		return [int(input()) for i in range(n)]

class Math:

	@staticmethod
	def gcd(a, b):
		if b == 0:
			return a
		return Math.gcd(b, a % b)

	@staticmethod
	def lcm(a, b):
		return a * b // Math.gcd(a, b)

	@staticmethod
	def divisor(n):
		res = []
		i = 1
		for i in range(1, int(n ** 0.5) + 1):
			if n % i == 0:
				res.append(i)
				if i != n // i:
					res.append(n // i)
		return res

	@staticmethod
	def round_up(a, b):
		return -(-a // b)

	@staticmethod
	def is_prime(n):
		if n < 2:
			return False
		if n == 2:
			return True
		if n % 2 == 0:
			return False
		d = int(n ** 0.5) + 1
		for i in range(3, d + 1, 2):
			if n % i == 0:
				return False
		return True

class PriorityQueue:

	def __init__(self, l=[]):
		self.q = l
		heapq.heapify(self.q)
		return

	def push(self, n):
		heapq.heappush(self.q, n)
		return

	def pop(self):
		return heapq.heappop(self.q)

def pop_count(x):
	x = x - (x >> 1 & 6148914691236517205)
	x = (x & 3689348814741910323) + (x >> 2 & 3689348814741910323)
	x = x + (x >> 4) & 1085102592571150095
	x = x + (x >> 8)
	x = x + (x >> 16)
	x = x + (x >> 32)
	return x & 127
MOD = int(1000000000.0) + 7
INF = int(1000000000000000.0)

def main():
	(s, v1, v2, t1, t2) = Scanner.map_int()
	a = s * v1 + t1 * 2
	b = s * v2 + t2 * 2
	if a == b:
		print('Friendship')
	elif a < b:
		print('First')
	else:
		print('Second')
main()


def solve(test):
	(s, v1, v2, t1, t2) = map(int, input().split())
	ans = 0
	if 2 * t1 + s * v1 < 2 * t2 + s * v2:
		ans = 1
	elif 2 * t1 + s * v1 > 2 * t2 + s * v2:
		ans = 2
	print('First' if ans == 1 else 'Second' if ans == 2 else 'Friendship')
t = 1
for _ in range(t):
	solve(_ + 1)


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
result1 = 2 * t1 + s * v1
result2 = 2 * t2 + s * v2
if result1 < result2:
	print('First')
elif result1 > result2:
	print('Second')
else:
	print('Friendship')


a = list(map(int, input().split()))
calc1 = a[0] * a[1] + a[3] * 2
calc2 = a[0] * a[2] + a[4] * 2
if calc2 == calc1:
	print('Friendship')
elif calc2 > calc1:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
time_for_first = s * v1 + 2 * t1
time_for_second = s * v2 + 2 * t2
if time_for_first < time_for_second:
	print('First')
elif time_for_second == time_for_first:
	print('Friendship')
else:
	print('Second')


firstline = [int(x) for x in input().strip().split(' ')]
NumCharacters = firstline[0]
PlayerOneTypingSpeed = firstline[1]
PlayerTwoTypingSpeed = firstline[2]
PlayerOnePing = firstline[3]
PlayerTwoPing = firstline[4]
PlayerOneTotalTime = 2 * PlayerOnePing + NumCharacters * PlayerOneTypingSpeed
PlayerTwoTotalTime = 2 * PlayerTwoPing + NumCharacters * PlayerTwoTypingSpeed
if PlayerOneTotalTime == PlayerTwoTotalTime:
	print('Friendship')
elif PlayerOneTotalTime < PlayerTwoTotalTime:
	print('First')
else:
	print('Second')


def keyRaces(ls):
	s1 = ls[1] * ls[0] + ls[3] * 2
	s2 = ls[2] * ls[0] + ls[4] * 2
	if s1 < s2:
		return 'First'
	elif s2 < s1:
		return 'Second'
	else:
		return 'Friendship'
ls = [int(i) for i in input().split()]
print(keyRaces(ls))


(a, v1, v2, t1, t2) = [int(i) for i in input().split()]
p1 = v1 * a + t1 + t1
p2 = v2 * a + t2 + t2
if p1 < p2:
	print('First')
elif p2 < p1:
	print('Second')
elif p1 == p2:
	print('Friendship')


def solve():
	(s, v1, v2, t1, t2) = [int(x) for x in input().split(' ')]
	t1 = t1 * 2 + s * v1
	t2 = t2 * 2 + s * v2
	if t1 > t2:
		return 'Second'
	elif t1 < t2:
		return 'First'
	else:
		return 'Friendship'
ans = solve()
print(ans)


(s, v1, v2, t1, t2) = input().split()
(s, v1, v2, t1, t2) = (int(s), int(v1), int(v2), int(t1), int(t2))
tt1 = 2 * t1 + v1 * s
tt2 = 2 * t2 + v2 * s
if tt1 < tt2:
	print('First')
elif tt1 > tt2:
	print('Second')
else:
	print('Friendship')


def main():
	[s, v1, v2, t1, t2] = list(map(int, input().split(' ')))
	tot1 = 2 * t1 + s * v1
	tot2 = 2 * t2 + s * v2
	if tot1 > tot2:
		print('Second')
	elif tot2 > tot1:
		print('First')
	else:
		print('Friendship')
main()


(s, v1, v2, t1, t2) = map(int, input().split())
S1 = t1 * 2 + v1 * s
S2 = t2 * 2 + v2 * s
if S1 < S2:
	print('First')
elif S1 > S2:
	print('Second')
else:
	print('Friendship')


a = input().split()
s = int(a[0])
v1 = int(a[1])
v2 = int(a[2])
t1 = int(a[3])
t2 = int(a[4])
x1 = 2 * t1 + s * v1
x2 = 2 * t2 + s * v2
if x1 < x2:
	print('First')
if x1 > x2:
	print('Second')
if x1 == x2:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
num = t1 * 2 + s * v1
num2 = t2 * 2 + s * v2
if num < num2:
	print('First')
elif num == num2:
	print('Friendship')
else:
	print('Second')


h = input().split(' ')
s = int(h[0])
vo = int(h[1])
vt = int(h[2])
to = int(h[3])
tt = int(h[4])
if s * vo + 2 * to < s * vt + 2 * tt:
	print('First')
elif s * vo + 2 * to > s * vt + 2 * tt:
	print('Second')
if s * vo + 2 * to == s * vt + 2 * tt:
	print('Friendship')


(s1, v1, v2, t1, t2) = map(int, input().split())
a = s1 * v1 + t1 * 2
b = s1 * v2 + t2 * 2
if a == b:
	print('Friendship')
if a < b:
	print('First')
if a > b:
	print('Second')


def end_time(str_len, time, ping):
	return 2 * ping + str_len * time

def main():
	(str_len, time1, time2, ping1, ping2) = map(int, input().split())
	time1 = end_time(str_len, time1, ping1)
	time2 = end_time(str_len, time2, ping2)
	if time1 == time2:
		print('Friendship')
	else:
		print('First' if time1 < time2 else 'Second')
main()


def main():
	(s, v1, v2, t1, t2) = read()
	l1 = v1 * s + t1 * 2
	l2 = v2 * s + t2 * 2
	if l1 < l2:
		return 'First'
	if l1 > l2:
		return 'Second'
	return 'Friendship'

def read(callback=int):
	return list(map(callback, input().strip().split()))

def write(value, end='\n'):
	if value is None:
		return
	try:
		if not isinstance(value, str):
			value = ' '.join(map(str, value))
	except:
		pass
	print(value, end=end)
write(main())


(s, v1, v2, t1, t2) = map(int, input().split())
finish_1 = v1 * s + 2 * t1
finish_2 = v2 * s + 2 * t2
if finish_1 < finish_2:
	print('First')
elif finish_1 > finish_2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
z = s * v1 + 2 * t1
z2 = s * v2 + 2 * t2
if z < z2:
	print('First')
elif z == z2:
	print('Friendship')
else:
	print('Second')


import math
(s, v1, v2, t1, t2) = map(int, input().split())
x = s * v1 + 2 * t1
y = s * v2 + 2 * t2
if x < y:
	print('First')
if x > y:
	print('Second')
if x == y:
	print('Friendship')


import math
count = 0
a = [int(x) for x in input().strip().split(' ')]
s = a[0]
v1 = a[1]
v2 = a[2]
t1 = a[3]
t2 = a[4]
first = 2 * t1 + s * v1
second = 2 * t2 + s * v2
if first > second:
	print('Second')
elif second > first:
	print('First')
else:
	print('Friendship')


from bisect import bisect_left, bisect_right
from sys import stdin as fin
(s, v1, v2, t1, t2) = map(int, fin.readline().split())
(st1, st2) = (s * v1 + 2 * t1, s * v2 + 2 * t2)
if st1 < st2:
	print('First')
elif st1 > st2:
	print('Second')
else:
	print('Friendship')


(k, v1, v2, t1, t2) = map(int, input().split())
result1 = t1 + v1 * k + t1
result2 = t2 + v2 * k + t2
if result1 < result2:
	print('First')
elif result2 < result1:
	print('Second')
else:
	print('Friendship')


s = [int(i) for i in input().split()]
p1 = s[0] * s[1] + 2 * s[3]
p2 = s[0] * s[2] + 2 * s[4]
if p1 < p2:
	print('First')
elif p2 < p1:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
tmp1 = t1 * 2 + s * v1
tmp2 = t2 * 2 + s * v2
if tmp1 < tmp2:
	print('First')
elif tmp1 > tmp2:
	print('Second')
else:
	print('Friendship')


def race(s, v_1, v_2, t_1, t_2):
	if s * v_1 + 2 * t_1 == s * v_2 + 2 * t_2:
		return 'Friendship'
	elif s * v_1 + 2 * t_1 < s * v_2 + 2 * t_2:
		return 'First'
	return 'Second'
(S, V_1, V_2, T_1, T_2) = [int(i) for i in input().split()]
print(race(S, V_1, V_2, T_1, T_2))


(s, v1, v2, t1, t2) = map(int, input().split())
d = v1 * s + 2 * t1
e = v2 * s + 2 * t2
if d == e:
	print('Friendship')
if d > e:
	print('Second')
if d < e:
	print('First')


(s, v1, v2, t1, t2) = map(int, input().split())
nino1 = 2 * t1 + s * v1
nino2 = 2 * t2 + s * v2
if nino1 < nino2:
	print('First')
elif nino1 > nino2:
	print('Second')
else:
	print('Friendship')


values = list(map(int, input().split()))
first_millis = 2 * values[3] + values[0] * values[1]
second_millis = 2 * values[4] + values[0] * values[2]
if first_millis < second_millis:
	print('First')
elif second_millis < first_millis:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, p1, p2) = map(int, input().split())
firstTime = s * v1 + 2 * p1
secondTime = s * v2 + 2 * p2
if firstTime < secondTime:
	print('First')
elif firstTime > secondTime:
	print('Second')
else:
	print('Friendship')


a = list(map(int, input().split()))
p1 = a[0] * a[1] + a[3] * 2
p2 = a[0] * a[2] + a[4] * 2
if p1 < p2:
	print('First')
if p1 > p2:
	print('Second')
if p1 == p2:
	print('Friendship')


a = [int(n) for n in input().split(' ')]
s = a[0]
v1 = a[1]
v2 = a[2]
t1 = a[3]
t2 = a[4]
n1 = s * v1
n2 = s * v2
if n1 + 2 * t1 > n2 + 2 * t2:
	print('Second')
elif n1 + 2 * t1 < n2 + 2 * t2:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
y1 = 2 * t1 + s * v1
y2 = 2 * t2 + s * v2
if y1 == y2:
	print('Friendship')
elif y1 < y2:
	print('First')
elif y2 < y1:
	print('Second')


s = [int(x) for x in input().split()]
(a, b) = (s[0] * s[1] + s[3] * 2, s[0] * s[2] + s[4] * 2)
print('Friendship' if a == b else 'First' if a < b else 'Second')


while True:
	try:
		(s, v1, v2, t1, t2) = map(int, input().split())
		sum1 = 2 * t1 + s * v1
		sum2 = 2 * t2 + s * v2
		if sum1 < sum2:
			print('First')
		elif sum1 > sum2:
			print('Second')
		else:
			print('Friendship')
	except EOFError:
		break


inp = list(map(int, input().split(' ')))
first = 2 * inp[-2] + inp[0] * inp[1]
second = 2 * inp[-1] + inp[0] * inp[2]
if first == second:
	print('Friendship')
elif first < second:
	print('First')
else:
	print('Second')


s = input().split(' ')
for i in range(len(s)):
	s[i] = int(s[i])
if s[0] * s[1] + 2 * s[3] < s[0] * s[2] + 2 * s[4]:
	print('First')
elif s[0] * s[1] + 2 * s[3] == s[0] * s[2] + 2 * s[4]:
	print('Friendship')
else:
	print('Second')


(s, v1, v2, t1, t2) = list(map(int, input().split()))
firstTime = 2 * t1 + s * v1
secondTime = 2 * t2 + s * v2
if firstTime < secondTime:
	print('First')
elif firstTime > secondTime:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, s1, s2) = map(int, input().split())
print('First' if 2 * s1 + v1 * s < 2 * s2 + v2 * s else 'Second' if 2 * s1 + v1 * s > 2 * s2 + v2 * s else 'Friendship')


line = input('').split()
s = int(line[0])
v1 = int(line[1])
v2 = int(line[2])
t1 = int(line[3])
t2 = int(line[4])
aux1 = 2 * t1 + s * v1
aux2 = 2 * t2 + s * v2
if aux1 < aux2:
	print('First')
elif aux2 < aux1:
	print('Second')
else:
	print('Friendship')


from sys import stdin
max_val = int(10000000000000.0)
min_val = int(-10000000000000.0)

def read_int():
	return int(stdin.readline())

def read_ints():
	return [int(x) for x in stdin.readline().split()]

def read_str():
	return input()

def read_strs():
	return [x for x in stdin.readline().split()]
(nb_chr, f_speed, s_speed, f_ext, s_ext) = read_ints()
first = nb_chr * f_speed + 2 * f_ext
secon = nb_chr * s_speed + 2 * s_ext
if first == secon:
	print('Friendship')
elif first > secon:
	print('Second')
else:
	print('First')


(s, v1, v2, t1, t2) = input().split()

def calk_time(s, v, t):
	return 2 * int(t) + int(s) * int(v)
diff = calk_time(s, v1, t1) - calk_time(s, v2, t2)
if diff < 0:
	result = 'First'
elif diff > 0:
	result = 'Second'
else:
	result = 'Friendship'
print(result)


import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
(s, v1, v2, t1, t2) = map(int, input().split())
ta = s * v1 + 2 * t1
tb = s * v2 + 2 * t2
if ta == tb:
	print('Friendship')
elif ta < tb:
	print('First')
else:
	print('Second')


inp = input()
inp = inp.split(' ')
text_length = int(inp[0])
time_participant_1 = int(inp[1])
time_participant_2 = int(inp[2])
ping1 = int(inp[3])
ping2 = int(inp[4])
player_one = ping1 * 2 + text_length * time_participant_1
player_two = ping2 * 2 + text_length * time_participant_2
if player_one > player_two:
	print('Second')
elif player_two > player_one:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
z1 = 2 * t1 + s * v1
z2 = 2 * t2 + s * v2
if z1 < z2:
	print('First')
elif z2 < z1:
	print('Second')
elif z1 == z2:
	print('Friendship')


k = input().split()
for i in range(len(k)):
	a = int(k[0])
	b = int(k[1])
	c = int(k[2])
	d = int(k[3])
	e = int(k[4])
x1 = e + c * a + e
x2 = d + b * a + d
if x1 > x2:
	print('First')
elif x1 < x2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = input().split()
(s, v1, v2, t1, t2) = (int(s), int(v1), int(v2), int(t1), int(t2))
end1 = 2 * t1 + v1 * s
end2 = 2 * t2 + v2 * s
if end1 == end2:
	print('Friendship')
elif end1 < end2:
	print('First')
else:
	print('Second')


from sys import stdin
(s, v1, v2, t1, t2) = map(int, stdin.readline().rstrip().split())
T1 = t1 + s * v1 + t1
T2 = t2 + s * v2 + t2
if T1 == T2:
	print('Friendship')
elif T1 < T2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
firsttime = s * v1 + 2 * t1
secondtime = s * v2 + 2 * t2
if firsttime < secondtime:
	print('First')
elif secondtime < firsttime:
	print('Second')
else:
	print('Friendship')


(s, v0, v1, p0, p1) = map(int, input().split())
if s * v0 + p0 + p0 < s * v1 + p1 + p1:
	print('First')
elif s * v0 + p0 + p0 > s * v1 + p1 + p1:
	print('Second')
else:
	print('Friendship')


(a, za, zb, sa, sb) = map(int, input().split())
x = a * za + sa * 2
c = a * zb + sb * 2
if x == c:
	print('Friendship')
elif x < c:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = map(int, input().split())
score_1 = s * v1 + 2 * t1
score_2 = s * v2 + 2 * t2
if score_1 == score_2:
	print('Friendship')
elif score_1 < score_2:
	print('First')
else:
	print('Second')


(s, v, w, t, y) = map(int, input().split(' '))
if 2 * t + s * v < 2 * y + s * w:
	print('First')
elif 2 * t + s * v > 2 * y + s * w:
	print('Second')
else:
	print('Friendship')


def read(is_int, split_by):
	if is_int:
		return [int(x) for x in input().split(split_by)]
	else:
		return [x for x in input().split(split_by)]
(s, v1, v2, t1, t2) = read(True, ' ')
answer = 'First'
if s * v1 + 2 * t1 < s * v2 + 2 * t2:
	answer = 'First'
elif s * v1 + 2 * t1 > s * v2 + 2 * t2:
	answer = 'Second'
elif s * v1 + 2 * t1 == s * v2 + 2 * t2:
	answer = 'Friendship'
print(answer)


def main():
	(s, v1, v2, t1, t2) = map(int, input().strip().split())
	p1 = s * v1 + 2 * t1
	p2 = s * v2 + 2 * t2
	if p1 == p2:
		print('Friendship')
	elif p1 < p2:
		print('First')
	else:
		print('Second')
main()


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
tot1 = s * v1 + 2 * t1
tot2 = s * v2 + 2 * t2
if tot1 < tot2:
	print('First')
elif tot1 == tot2:
	print('Friendship')
else:
	print('Second')


s = list(map(int, input().split()))
sum1 = 2 * s[3] + s[1] * s[0]
sum2 = 2 * s[4] + s[2] * s[0]
if sum1 < sum2:
	print('First')
elif sum1 > sum2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
first = s * v1 + 2 * t1
second = s * v2 + 2 * t2
ans = 'First' if first < second else 'Second'
ans = 'Friendship' if first == second else ans
print(ans)


from sys import stdin

def read():
	return stdin.readline().strip()
(s, v1, v2, t1, t2) = map(int, read().split())
first = s * v1 + 2 * t1
second = s * v2 + 2 * t2
if first < second:
	print('First')
elif second < first:
	print('Second')
else:
	print('Friendship')


x = [int(y) for y in input().split()]
s = int(x[0])
t1 = int(x[1])
t2 = int(x[2])
p1 = int(x[3])
p2 = int(x[4])
if s * t1 + p1 * 2 < s * t2 + p2 * 2:
	print('First')
elif s * t1 + p1 * 2 > s * t2 + p2 * 2:
	print('Second')
else:
	print('Friendship')


(q, w, e, r, t) = map(int, input().split())
print('First' if q * w + r + r < q * e + t + t else 'Second' if q * w + r + r > q * e + t + t else 'Friendship')


(s, first, second, t1, t2) = map(int, input().split())
S1 = 2 * t1 + s * first
S2 = 2 * t2 + s * second
if S1 > S2:
	print('Second')
if S1 < S2:
	print('First')
if S1 == S2:
	print('Friendship')


t = input()
arr = t.split(' ')
if int(arr[0]) * int(arr[1]) + int(arr[3]) * 2 < int(arr[0]) * int(arr[2]) + int(arr[4]) * 2:
	print('First')
elif int(arr[0]) * int(arr[1]) + int(arr[3]) * 2 > int(arr[0]) * int(arr[2]) + int(arr[4]) * 2:
	print('Second')
elif int(arr[0]) * int(arr[1]) + int(arr[3]) * 2 == int(arr[0]) * int(arr[2]) + int(arr[4]) * 2:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
if t1 >= t2:
	raz = t1 - t2
	first = s * v1 + t1 + raz
	two = s * v2 + t2
else:
	raz = t2 - t1
	first = s * v1 + t1
	two = s * v2 + t2 + raz
if first > two:
	print('Second')
if first < two:
	print('First')
if first == two:
	print('Friendship')


(s, v, u, t, o) = map(int, input().split())
a = s * v + 2 * t
b = s * u + 2 * o
print('Second' if a > b else 'Friendship' if a == b else 'First')


n = input()
(s, v1, v2, t1, t2) = n.split()
am1 = 0
am2 = 0
am1 = int(t1) * 2 + int(v1) * int(s)
am2 = int(t2) * 2 + int(v2) * int(s)
if am1 == am2:
	print('Friendship')
elif am1 > am2:
	print('Second')
else:
	print('First')


inside = input()
(slovo, speed1, speed2, ping1, ping2) = list(map(int, inside.split()))
result1 = ping1 * 2 + slovo * speed1
result2 = ping2 * 2 + slovo * speed2
if result1 == result2:
	print('Friendship')
elif result1 > result2:
	print('Second')
else:
	print('First')


(s, v1, v2, t1, t2) = map(int, input().split())
if 1 <= s <= 1000 and 1 <= v1 <= 1000 and (1 <= v2 <= 1000) and (1 <= t1 <= 1000) and (1 <= t2 <= 1000):
	if 2 * t1 + s * v1 < 2 * t2 + s * v2:
		print('First')
	elif 2 * t1 + s * v1 > 2 * t2 + s * v2:
		print('Second')
	else:
		print('Friendship')


def calc(t, s, v: int) -> int:
	t *= 2
	t += s * v
	return t

def main():
	(s, v1, v2, t1, t2) = map(int, input().split())
	t = calc(t1, s, v1) - calc(t2, s, v2)
	if t < 0:
		print('First')
	if t > 0:
		print('Second')
	if t == 0:
		print('Friendship')
main()


inp = input
li = list
iinp = lambda : int(inp())
ent = lambda : map(int, inp().split())
lient = lambda : [int(i) for i in inp().split()]
li0 = lambda x: [0 for i in range(x)]
stent = lambda : [i for i in inp()]
(s, v1, v2, t1, t2) = ent()
primero = s * v1 + t1 * 2
segundo = s * v2 + t2 * 2
if primero < segundo:
	print('First')
elif segundo < primero:
	print('Second')
else:
	print('Friendship')


(symbol_in_text, speed_1, speed_2, ping_1, ping_2) = [int(i) for i in input().split()]
time_1 = symbol_in_text * speed_1 + 2 * ping_1
time_2 = symbol_in_text * speed_2 + 2 * ping_2
if time_1 < time_2:
	print('First')
elif time_1 > time_2:
	print('Second')
else:
	print('Friendship')


(a, b, c, d, e) = [int(i) for i in input().split()]
p1 = 2 * d
p2 = 2 * e
p1 = p1 + a * b
p2 = p2 + a * c
if p1 < p2:
	print('First')
elif p1 > p2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
val1 = t1 + s * v1 + t1
val2 = t2 + s * v2 + t2
if val1 == val2:
	print('Friendship')
else:
	print('First') if val1 < val2 else print('Second')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
vs1 = s * v1 + 2 * t1
vs2 = s * v2 + 2 * t2
if vs1 < vs2:
	print('First')
elif vs1 > vs2:
	print('Second')
else:
	print('Friendship')


(size, speedFirst, speedSecond, pingFirst, pingSecond) = input().split()
size = int(size)
speedFirst = int(speedFirst)
speedSecond = int(speedSecond)
pingFirst = int(pingFirst)
pingSecond = int(pingSecond)
timeFirst = size * speedFirst + 2 * pingFirst
timeSecond = size * speedSecond + 2 * pingSecond
if timeFirst < timeSecond:
	print('First')
elif timeFirst > timeSecond:
	print('Second')
elif timeFirst == timeSecond:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split(' ')]
final_time_1 = v1 * s + t1 * 2
final_time_2 = v2 * s + t2 * 2
if final_time_1 < final_time_2:
	print('First')
elif final_time_1 > final_time_2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
v1 *= s
v2 *= s
t1 <<= 1
t2 <<= 1
v1 += t1
v2 += t2
if v1 == v2:
	print('Friendship')
else:
	print(['First', 'Second'][v1 > v2])


cmd = input().split()
a = int(cmd[0]) * int(cmd[1]) + 2 * int(cmd[3])
b = int(cmd[0]) * int(cmd[2]) + 2 * int(cmd[4])
print('First') if a < b else print('Second') if a > b else print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
result_1 = s * v1 + t1 * 2
result_2 = s * v2 + t2 * 2
if result_1 < result_2:
	print('First')
elif result_1 > result_2:
	print('Second')
else:
	print('Friendship')


a = [int(i) for i in input().split()]
a1 = 2 * a[3] + a[0] * a[1]
a2 = 2 * a[4] + a[0] * a[2]
if a1 < a2:
	print('First')
elif a1 > a2:
	print('Second')
else:
	print('Friendship')


class CodeforcesTask835ASolution:

	def __init__(self):
		self.result = ''
		self.s_vv_tt = []

	def read_input(self):
		self.s_vv_tt = [int(x) for x in input().split(' ')]

	def process_task(self):
		r1 = self.s_vv_tt[0] * self.s_vv_tt[1] + 2 * self.s_vv_tt[3]
		r2 = self.s_vv_tt[0] * self.s_vv_tt[2] + 2 * self.s_vv_tt[4]
		if r1 == r2:
			self.result = 'Friendship'
		elif r1 < r2:
			self.result = 'First'
		else:
			self.result = 'Second'

	def get_result(self):
		return self.result
Solution = CodeforcesTask835ASolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())


input_values = input().split(' ')
s = int(input_values[0])
v1 = int(input_values[1])
v2 = int(input_values[2])
t1 = int(input_values[3])
t2 = int(input_values[4])
first_user_value = t1 * 2 + s * v1
second_user_value = t2 * 2 + s * v2
if first_user_value == second_user_value:
	print('Friendship')
elif first_user_value < second_user_value:
	print('First')
elif second_user_value < first_user_value:
	print('Second')


n = input().split()
s = int(n[0])
f = s * int(n[1]) + int(n[3]) * 2
sec = s * int(n[2]) + int(n[4]) * 2
if f < sec:
	print('First')
elif sec < f:
	print('Second')
elif sec == f:
	print('Friendship')


(matn, yak, duyum, se1, se2) = map(int, input().split())
s = yak * matn + se1 * 2
s2 = duyum * matn + se2 * 2
if s < s2:
	print('First')
	exit()
if s > s2:
	print('Second')
	exit()
print('Friendship')


(chars, t1, t2, p1, p2) = list(map(int, input().split()))
first = chars * t1 + 2 * p1
second = chars * t2 + 2 * p2
if first < second:
	print('First')
elif first > second:
	print('Second')
else:
	print('Friendship')


(chars, speed_a, speed_b, ping_a, ping_b) = map(int, input().split(' '))
first = chars * speed_a + ping_a * 2
second = chars * speed_b + ping_b * 2
if first < second:
	print('First')
elif first > second:
	print('Second')
elif first == second:
	print('Friendship')


(a, b, c, d, e) = map(int, input().split())
primu = a * b + 2 * d
doilea = a * c + 2 * e
if primu < doilea:
	print('First')
elif primu > doilea:
	print('Second')
elif primu == doilea:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
tf = t1 * 2 + s * v1
ts = t2 * 2 + s * v2
if tf < ts:
	print('First')
if tf > ts:
	print('Second')
if tf == ts:
	print('Friendship')


fast = lambda : stdin.readline().strip()
zzz = lambda : [int(i) for i in fast().split()]
(z, zz) = (input, lambda : list(map(int, z().split())))
(szz, graph, mod, szzz) = (lambda : sorted(zz()), {}, 10 ** 9 + 7, lambda : sorted(zzz()))
from re import *
from sys import *
from math import *
from heapq import *
from queue import *
from bisect import *
from string import *
from itertools import *
from collections import *
from math import factorial as f
from bisect import bisect as bs
from bisect import bisect_left as bsl
from collections import Counter as cc
from itertools import accumulate as ac

def lcd(xnum1, xnum2):
	return xnum1 * xnum2 // gcd(xnum1, xnum2)

def output(answer):
	stdout.write(str(answer))
(s, v1, v2, t1, t2) = zzz()
f = v1 * s + 2 * t1
s = v2 * s + 2 * t2
if f < s:
	print('First')
elif f > s:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
u1 = 2 * t1 + s * v1
u2 = 2 * t2 + s * v2
if u1 < u2:
	print('First')
elif u2 < u1:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, p1, p2) = map(int, input().split()[:5])
f = v1 * s + 2 * p1
s = v2 * s + 2 * p2
if f < s:
	print('First')
elif s < f:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
rez1 = s * v1 + 2 * t1
rez2 = s * v2 + 2 * t2
if rez1 == rez2:
	print('Friendship')
elif rez1 < rez2:
	print('First')
else:
	print('Second')


a = list(map(int, input().split()))
s1 = a[0] * a[1] + 2 * a[3]
s2 = a[0] * a[2] + 2 * a[4]
if s1 < s2:
	print('First')
elif s2 < s1:
	print('Second')
else:
	print('Friendship')


def race(s, v1, v2, t1, t2):
	res1 = 2 * t1 + v1 * s
	res2 = 2 * t2 + v2 * s
	if res1 < res2:
		return 'First'
	elif res1 > res2:
		return 'Second'
	else:
		return 'Friendship'
(s, v1, v2, t1, t2) = map(int, input().split())
print(race(s, v1, v2, t1, t2))


x = [int(x) for x in input().split(' ')]
num_char = x[0]
v_one = x[1]
v_two = x[2]
ping_one = x[3]
ping_two = x[4]
time_1 = 0
time_2 = 0
time_1 += ping_one * 2 + v_one * num_char
time_2 += ping_two * 2 + v_two * num_char
if time_1 < time_2:
	print('First')
elif time_1 == time_2:
	print('Friendship')
else:
	print('Second')


x = input('')
y = x.split()
s = int(y[0])
v1 = int(y[1])
v2 = int(y[2])
t1 = int(y[3])
t2 = int(y[4])
T1 = s * v1 + 2 * t1
T2 = s * v2 + 2 * t2
if T1 > T2:
	print('Second')
if T2 > T1:
	print('First')
if T2 == T1:
	print('Friendship')


a = input().split()
if int(a[3]) * 2 + int(a[0]) * int(a[1]) < int(a[4]) * 2 + int(a[0]) * int(a[2]):
	print('First')
elif int(a[3]) * 2 + int(a[0]) * int(a[1]) > int(a[4]) * 2 + int(a[0]) * int(a[2]):
	print('Second')
else:
	print('Friendship')


import sys
(S, v1, v2, t1, t2) = map(int, sys.stdin.readline().split())
P1 = 2 * t1 + S * v1
P2 = 2 * t2 + S * v2
if P1 < P2:
	print('First')
if P2 < P1:
	print('Second')
if P2 == P1:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split(' '))
list_1 = [s, v1, v2, t1, t2]
count = 0
for i in range(5):
	if list_1[i] <= 1000 and list_1[i] >= 1:
		count = count + 1
if count == 5:
	time_1 = s * v1 + 2 * t1
	time_2 = s * v2 + 2 * t2
	if time_1 < time_2:
		print('First')
	elif time_2 < time_1:
		print('Second')
	else:
		print('Friendship')


(c, fv, sv, fp, sp) = tuple(map(int, input().split()))
(f, s) = (c * fv + 2 * fp, c * sv + 2 * sp)
print('First') if f < s else print('Friendship') if f == s else print('Second')


numbers = input()
n = numbers.strip().split(' ')
n = list(map(int, n))
s = n[0]
v1 = n[1]
v2 = n[2]
t1 = n[3]
t2 = n[4]
time1 = 2 * t1 + v1 * s
time2 = 2 * t2 + v2 * s
if time1 < time2:
	print('First')
elif time2 < time1:
	print('Second')
else:
	print('Friendship')


def main():
	nums = list(map(int, input().split()))
	a = nums[0] * nums[1] + nums[3] * 2
	b = nums[0] * nums[2] + nums[4] * 2
	if a < b:
		print('First')
	elif a == b:
		print('Friendship')
	else:
		print('Second')
main()


x = input()
y = x.split()
s = int(y[0])
v1 = int(y[1])
v2 = int(y[2])
t1 = int(y[3])
t2 = int(y[4])
c = s * (v1 - v2) + 2 * (t1 - t2)
if c < 0:
	print('First')
elif c > 0:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
ping1 = t1 * 2
ping2 = t2 * 2
main1 = s * v1
main2 = s * v2
f1 = main1 + ping1
f2 = main2 + ping2
if f1 < f2:
	print('First')
elif f1 > f2:
	print('Second')
elif f1 == f2:
	print('Friendship')


l = list(map(int, input().strip().split(' ')))
n = l[0]
v1 = l[1]
v2 = l[2]
t1 = l[3]
t2 = l[4]
a1 = n * v1 + 2 * t1
a2 = n * v2 + 2 * t2
if a1 < a2:
	print('First')
elif a1 > a2:
	print('Second')
else:
	print('Friendship')


n = input().split()
n = [int(i) for i in n]
symbols = n[0]
speed1 = n[1]
speed2 = n[2]
ping1 = n[3]
ping2 = n[4]
first = ping1 + speed1 * symbols + ping1
second = ping2 + speed2 * symbols + ping2
if first < second:
	print('First')
elif first > second:
	print('Second')
else:
	print('Friendship')


n = input().split(' ')
n = list(map(int, n))
n1 = 0
n2 = 0
n1 = n[0] * n[1] + 2 * n[3]
n2 = n[0] * n[2] + 2 * n[4]
if n1 > n2:
	print('Second')
elif n1 < n2:
	print('First')
else:
	print('Friendship')


(a, b, c, d, e) = map(int, input().split())
p1 = a * b + d * 2
p2 = a * c + e * 2
if p1 != p2:
	if p1 < p2:
		print('First')
	else:
		print('Second')
else:
	print('Friendship')


(l, t1, t2, p1, p2) = map(int, input().strip().split()[:5])
k1 = l * t1 + 2 * p1
k2 = l * t2 + 2 * p2
if k1 < k2:
	print('First')
elif k2 < k1:
	print('Second')
else:
	print('Friendship')


from sys import stdin

def main():
	summ = 0
	(s, v1, v2, t1, t2) = [int(x) for x in stdin.readline().strip().split()]
	p1 = 'First'
	p2 = 'Second'
	empy = 'Friendship'
	resp1 = s * v1 + 2 * t1
	resp2 = s * v2 + 2 * t2
	if resp1 > resp2:
		print(p2)
	elif resp1 < resp2:
		print(p1)
	elif resp1 == resp2:
		print(empy)
main()


(s, a, b, c, d) = map(int, input().split())
x = s * a + c * 2
y = s * b + d * 2
if x == y:
	print('Friendship')
elif x > y:
	print('Second')
elif y > x:
	print('First')


vvtt = input().split()
for i in range(5):
	vvtt[i] = int(vvtt[i])
s = vvtt[0]
v1 = vvtt[1]
v2 = vvtt[2]
t1 = vvtt[3]
t2 = vvtt[4]
first = v1 * s + 2 * t1
second = v2 * s + 2 * t2
if first > second:
	print('Second')
elif first < second:
	print('First')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
fi = s * v1 + 2 * t1
se = s * v2 + 2 * t2
if fi < se:
	print('First')
elif se < fi:
	print('Second')
else:
	print('Friendship')


def countTime(s, v1, t1):
	return s * v1 + 2 * t1
(s, v1, v2, t1, t2) = map(int, input().split(' '))
firstPLayer = countTime(s, v1, t1)
secondPlayer = countTime(s, v2, t2)
if firstPLayer < secondPlayer:
	print('First')
elif firstPLayer > secondPlayer:
	print('Second')
else:
	print('Friendship')


(p, x, y, a, b) = [int(i) for i in input().split()]
x1 = p * x + a * 2
y1 = p * y + b * 2
if x1 < y1:
	print('First')
elif x1 > y1:
	print('Second')
else:
	print('Friendship')


(s, a, b, c, d) = map(int, input().split())
k1 = a * s + c * 2
k2 = b * s + d * 2
if k1 < k2:
	print('First')
elif k1 > k2:
	print('Second')
else:
	print('Friendship')


import sys

def total_time(s, v, t):
	return s * v + 2 * t
(s, v1, v2, t1, t2) = map(int, sys.stdin.readline().split())
x1 = total_time(s, v1, t1)
x2 = total_time(s, v2, t2)
if x1 == x2:
	print('Friendship')
elif x1 < x2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
d1 = 2 * t1 + v1 * s
d2 = 2 * t2 + v2 * s
if d1 < d2:
	print('First')
elif d1 > d2:
	print('Second')
else:
	print('Friendship')


I = [int(x) for x in input().split()]
time1 = I[0] * I[1] + 2 * I[3]
time2 = I[0] * I[2] + 2 * I[4]
if time1 < time2:
	print('First')
elif time1 > time2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(i) for i in input().strip().split(' ')]
total1 = t1 + s * v1 + t1
total2 = t2 + s * v2 + t2
if total1 < total2:
	print('First')
elif total2 < total1:
	print('Second')
else:
	print('Friendship')


res = [int(n) for n in input().split()]
ftotal = int(res[0]) * int(res[1]) + 2 * res[3]
stotal = int(res[0]) * int(res[2]) + 2 * res[4]
if ftotal < stotal:
	print('First')
elif ftotal > stotal:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
h1 = v1 * s + 2 * t1
h2 = v2 * s + 2 * t2
if h1 < h2:
	print('First')
elif h2 < h1:
	print('Second')
else:
	print('Friendship')


def main():
	n = input()
	val = n.split(' ')
	s = int(val[0])
	v1 = int(val[1])
	v2 = int(val[2])
	t1 = int(val[3])
	t2 = int(val[4])
	one = s * v1 + 2 * t1
	two = s * v2 + 2 * t2
	if one < two:
		print('First')
	elif one > two:
		print('Second')
	else:
		print('Friendship')
main()


(s, v1, v2, t1, t2) = [int(i) for i in input().split()]
t11 = s * v1
t22 = s * v2
t111 = t11 + t1 * 2
t222 = t22 + t2 * 2
if t111 < t222:
	print('First')
elif t222 < t111:
	print('Second')
else:
	print('Friendship')


typing = [int(key) for key in input().split(' ')]
first = typing[0] * typing[1] + 2 * typing[3]
second = typing[0] * typing[2] + 2 * typing[4]
if first < second:
	print('First')
elif second < first:
	print('Second')
else:
	print('Friendship')


params = [int(x) for x in input().split()]
t1 = params[0] * params[1] + 2 * params[3]
t2 = params[0] * params[2] + 2 * params[4]
if t1 > t2:
	print('Second')
elif t1 < t2:
	print('First')
else:
	print('Friendship')


a = list(map(int, input().split()))
ta = a[0] * a[1] + 2 * a[3]
tb = a[0] * a[2] + 2 * a[4]
if ta < tb:
	print('First')
elif ta > tb:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = [int(x) for x in input().split(' ')]
to1 = v1 * s + t1 * 2
to2 = v2 * s + t2 * 2
if to1 < to2:
	print('First')
elif to1 > to2:
	print('Second')
else:
	print('Friendship')


(a, b, c, d, e) = [int(i) for i in input().split()]
k1 = a * b + 2 * d
k2 = a * c + 2 * e
if k1 > k2:
	print('Second')
if k1 < k2:
	print('First')
if k1 == k2:
	print('Friendship')


(a, v1, v2, t1, t2) = list(map(int, input().strip().split()))
c = a * v1 + 2 * t1
p = a * v2 + 2 * t2
if c < p:
	print('First')
elif p < c:
	print('Second')
else:
	print('Friendship')


def chop():
	return (int(i) for i in input().split())
(s, v1, v2, t1, t2) = chop()
a1 = s * v1 + t1 * 2
a2 = s * v2 + t2 * 2
if a1 == a2:
	print('Friendship')
elif a1 < a2:
	print('First')
else:
	print('Second')


(s, v1, v2, t1, t2) = [int(x) for x in input().split()]
if t1 * 2 + s * v1 < t2 * 2 + s * v2:
	print('First')
if t1 * 2 + s * v1 == t2 * 2 + s * v2:
	print('Friendship')
if t1 * 2 + s * v1 > t2 * 2 + s * v2:
	print('Second')


num = [*map(int, input().split())]
word = ['Second', 'First']
print('Friendship' if num[0] * num[1] + num[3] * 2 == num[0] * num[2] + num[4] * 2 else word[int(num[0] * num[1] + num[3] * 2 < num[0] * num[2] + num[4] * 2)])


def max1(a):
	p = a[0]
	for x in a:
		if x > p:
			p = x
	return p

def preobr(x):
	if x % 2 == 1:
		return x + 1
	else:
		return x - 1

def prlist(a):
	for x in a:
		print(x, end=' ')

def dlin(n):
	k = 0
	while n > 0:
		n -= k
		k += 1
	return k - 1
a = list(map(int, input().split()))
t1 = a[0] * a[1] + a[3] * 2
t2 = a[0] * a[2] + a[4] * 2
if t1 < t2:
	print('First')
elif t1 > t2:
	print('Second')
else:
	print('Friendship')


(s, v1, v2, t1, t2) = map(int, input().split())
duration1 = s * v1 + t1 * 2
duration2 = s * v2 + t2 * 2
if duration1 < duration2:
	print('First')
elif duration1 > duration2:
	print('Second')
else:
	print('Friendship')


a = input().split()
b = int(a[0])
c = int(a[1])
d = int(a[2])
k = int(a[3])
l = int(a[4])
if b * c + 2 * k < b * d + 2 * l:
	print('First')
elif b * c + 2 * k > b * d + 2 * l:
	print('Second')
else:
	print('Friendship')