// Arup Guha
// 10/8/2015
// Solution to 2001 UCF HS Contest Problem: Jumping Monks

import java.util.*;

public class monks {

	final public static int DISTANCE = 100;

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();

		// Solve each case - just integer division.
		for (int loop=0; loop<numCases; loop++)
			System.out.println(DISTANCE/stdin.nextInt());
	}
}