Sith vs Jedi
Тёмная сторона скрывает всё.
Невозможно будущее предвидеть нам.
Мастер Йода
On the abandoned planet Jedi and Sith were. They knew the equal number of skills of the Force. Day and night Jedi and Sith spent in the battle. Over time, each of them improves his skills. Master Yoda is watching the battle from the side. He knows at what point Jedi will be as good as a Sith. And can you, feeling the indignation of the Force, answer this question?
The Jedi and Sith powers are denoted by integers. Both warriors have n skills. Initially, Jedi skills are given by the numbers j[i] and Sith skills are s[i] (1 ≤ i ≤ n).
During the battle, Jedi and the Sith improve their skills. The Jedi Power of the i-th skill increases by l[i] in one day of the battle. In the case of the Sith, his i-th skill increases by d[i] each day.
It is believed that one opponent in a battle is no worse than another, if all his skills are designated by not less numbers than the corresponding skills of the enemy.
Write a program that will find the first day when Jedi will be no worse than Sith. Days are numbered from zero.
Input
First line contains one integer n (1 ≤ n ≤ 100) - the number of skills available to Jedi and Sith. Next line contains n integers j[i] - the starting knowledge of the Force for Jedi. Third line contains n integers l[i] - the increase of the i-th ability for Jedi during the battle day. Fourth line contains n integers s[i] - the starting knowledge of the Force for Sith. Fifth line contains n integers d[i] - the increase of the i-th ability for Sith during the battle day. All input data are nonnegative and do not exceed 1000.
Output
Print one number - the number of the first day, when Jedi will be no worse than Sith. If this day will not come, print the phrase "Strong is dark side of the force.".