{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"Two frogs met online and had a great chat. They decided it was necessary to meet in person. They were delighted to find out that they lived on the same line of latitude, so they agreed to jump westward until they met. However, before they set off, they forgot something very important. They didn\u0027t ask about each other\u0027s features, nor did they specify the exact meeting point. But the frogs were both very optimistic, believing that as long as they kept jumping in a certain direction, they would eventually meet. However, unless the two frogs jump to the same point at the same time, they will never meet. To help these two optimistic frogs, you are asked to write a program to determine whether the two frogs can meet and when they will meet. \u003cbr\u003e We will call these two frogs Frog A and Frog B, and we define the origin at the 0 degree east longitude on the latitude line, with the positive direction being westward, and the unit length being 1 meter. This gives us a circular number line. Let the coordinates of Frog A\u0027s starting point be x, and Frog B\u0027s starting point be y. Frog A can jump m meters at a time, and Frog B can jump n meters at a time, with both frogs spending the same amount of time for each jump. The total length of the latitude line is L meters. Now you are required to find out how many jumps they need to make in order to meet."}},{"title":"Input","value":{"format":"HTML","content":"The input consists of only one line with 5 integers: x, y, m, n, L, where x≠y \u0026lt; 2000000000, 0 \u0026lt; m, n \u0026lt; 2000000000, 0 \u0026lt; L \u0026lt; 2100000000."}},{"title":"Output","value":{"format":"HTML","content":"Output the number of jumps required to meet. If it is impossible for them to meet, output \"Impossible\"."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1 2 3 4 5\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}}]}