Problem:
Score : 200 points

Problem Statement

Takahashi is standing on a two-dimensional plane, facing north. Find the minimum positive integer K such that Takahashi will be at the starting position again after he does the following action K times:

Go one meter in the direction he is facing. Then, turn X degrees counter-clockwise.

Constraints

1 \leq X \leq 179

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

Print the number of times Takahashi will do the action before he is at the starting position again.

Sample Input 1

90

Sample Output 1

4

Takahashi's path is a square.

Sample Input 2

1

Sample Output 2

360

Solution in C# (Mono-mcs 6.8.0.105) (judge verdict: Wrong Answer)

using System;

class A{
  public static void Main(){
    int i = int.Parse(Console.ReadLine());
    int z, a, k;
    for (int j = 1; j < 10; j++){
      a = 360 * j;
      k = a / i;
      if (k * i == a){
        Console.WriteLine(k);
        return;
      }
    }
  }
}