Sith vs Jedi#5503

Sith vs Jedi

1 second
128 megabytes
Medium

The dark side hides everything.

Impossible to foresee the future for us.

Master Yoda

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 skills. Initially, Jedi skills are given by the numbers j_i and Sith skills are s_i (1 \leq i \leq n).

During the battle, Jedi and the Sith improve their skills. The Jedi Power of the -th skill increases by l_i in one day of the battle. In the case of the Sith, his -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

The first line contains one integer (1 \leq n \leq 100) — the number of skills available to Jedi and Sith.

The next line contains integers j_i — the starting knowledge of the Force for Jedi.

The third line contains integers l_i — the increase of the -th ability for Jedi during the battle day.

The fourth line contains integers s_i — the starting knowledge of the Force for Sith.

The fifth line contains integers d_i — the increase of the -th ability for Sith during the battle day.

All input data are nonnegative and do not exceed .

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.".

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading