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# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;

using System.Collections.Generic;

namespace AtCoderTest
{
    class Program
    {
        static void Main()
        {
            int X = int.Parse(Console.ReadLine().Trim());

            int loop = 360;
            int result=0;
            int k = 1;
            while (k != 0) {
                result = loop / X;
                k = loop % X;
                if (k != 0) loop = k + 360;

            }

            Console.WriteLine(result);

        }



    }

}