// Arup Guha
// 1/5/2014
// Solution to 2005 MCPC Problem D: Copier Reduction

import java.util.*;

public class d {

	final public static double EPSILON = 1e-9;

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int[] original = new int[2];
		int[] shrink = new int[2];

		for (int i=0; i<2; i++) original[i] = stdin.nextInt();
		for (int i=0; i<2; i++) shrink[i] = stdin.nextInt();

		// Process all valid cases.
		while (original[0] > 0) {

			// Sort and calculate best ratio, comparing like sides.
			Arrays.sort(original);
			Arrays.sort(shrink);
			double ratio = Math.min(1, Math.min((double)shrink[0]/original[0], (double)shrink[1]/original[1]));

			// Round down to nearest integer percentage and print.
			int ans = (int)(100*ratio+EPSILON);
			System.out.println(ans+"%");

			// Get next case.
			for (int i=0; i<2; i++) original[i] = stdin.nextInt();
			for (int i=0; i<2; i++) shrink[i] = stdin.nextInt();
		}

	}
}