package com.example.Twochapter;
import java.util.Scanner;
public class Main2 {
public static double Max(double d_sm,double d_sh,double d_mh ){
return (d_sm>d_sh)?(d_sm>d_mh?d_sm:d_mh):(d_sh>d_mh?d_sh:d_mh);
}
public static double Min(double not_d_sm,double not_d_sh,double not_d_mh){
return (not_d_sm>not_d_sh)?(not_d_sh>not_d_mh?not_d_mh:not_d_sh):(not_d_sm>not_d_mh?not_d_mh:not_d_sm);
}
public static void main(String[] args) {
double cycle_sm=3600.0/59,cycle_sh=360*120.0/719,cycle_mh=360*120.0/11;
double sm=10.0/59,sh=120.0/719,mh=120.0/11;
Scanner scanner=new Scanner(System.in);
while(scanner.hasNext()){
double happys,happye,sum=0;
int degree = scanner.nextInt();
if(degree==-1) return ;
double d_sm=sm*degree,d_sh=sh*degree,d_mh=mh*degree;//第一次出现满足夹角大于D度
double not_d_sm=cycle_sm-d_sm,not_d_sh=cycle_sh-d_sh,not_d_mh=cycle_mh-d_mh;//第一次不大于D度
happys=Max(d_sm,d_sh,d_mh);
happye=Min(not_d_sm,not_d_sh,not_d_mh);
while(happys<=43200&&happye<=43200){
happys=Max(d_sm,d_sh,d_mh);
happye=Min(not_d_sm,not_d_sh,not_d_mh);
if(happys<happye)
sum+=happye-happys;//如果 end的 时间比start的 晚,由 sum记录并累积
if(happye==not_d_sm)
{d_sm+=cycle_sm;not_d_sm+=cycle_sm;}
else if(happye==not_d_sh)
{d_sh+=cycle_sh;not_d_sh+=cycle_sh;}
else if(happye==not_d_mh)
{d_mh+=cycle_mh;not_d_mh+=cycle_mh;}//happy时间end后最慢的指针要提前一个周期才能让比它快的再次追上
}
System.out.printf("%.3f",sum/43200*100);
System.out.println();
}
}
}