Problem:
﻿Score: 100 points

Problem Statement

In AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.

Two antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.

Determine if there exists a pair of antennas that cannot communicate directly.

Here, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.

Constraints

a, b, c, d, e and k are integers between 0 and 123 (inclusive).

a < b < c < d < e

Input

Input is given from Standard Input in the following format:

a
b
c
d
e
k

Output

Print :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.

Sample Input 1

1
2
4
8
9
15

Sample Output 1

Yay!

In this case, there is no pair of antennas that cannot communicate directly, because:

the distance between A and B is 2 - 1 = 1

the distance between A and C is 4 - 1 = 3

the distance between A and D is 8 - 1 = 7

the distance between A and E is 9 - 1 = 8

the distance between B and C is 4 - 2 = 2

the distance between B and D is 8 - 2 = 6

the distance between B and E is 9 - 2 = 7

the distance between C and D is 8 - 4 = 4

the distance between C and E is 9 - 4 = 5

the distance between D and E is 9 - 8 = 1

and none of them is greater than 15. Thus, the correct output is Yay!.

Sample Input 2

15
18
26
35
36
18

Sample Output 2

:(

In this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.
Thus, the correct output is :(.

Solution in Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		// 整数の入力
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		int d = sc.nextInt();
		int e = sc.nextInt();
		
		int aa = a % 10;
		int bb = b % 10;
		int cc = c % 10;
		int dd = d % 10;
		int ee = e % 10;
      if(aa == 0){
        aa += 10;
      } if(bb == 0){
        bb += 10;
      }if(cc == 0){
        cc += 10;
      } if(dd == 0){
        dd += 10;
      } if(ee == 0){
        ee += 10;
      }
		int min = 10;
		if(min < aa){
		    min = aa;
		}if(min < bb){
		    min = bb;
		}if(min < cc){
		    min = cc;
		}if(min < dd){
		    min = dd;
		}if(min < ee){
		    min = ee;
		}
      double aaa = 0;
      double bbb = 0;
      double ccc = 0;
      double ddd = 0;
      double eee = 0;
      
      	if(a%10 != 0){
		 aaa = (Math.round((a) / 10))*10;
        }else{
         aaa = a;
        }
      if(b%10 != 0){
		bbb = (Math.round((b) / 10))*10;
        }else{
         bbb = b;
        }
      if(c%10 != 0){
		 ccc = (Math.round((c) / 10))*10;
        }else{
         ccc = c;
        }
      if(d%10 != 0){
		 ddd = (Math.round((d) / 10))*10;
        }else{
         ddd = d;
        }
      if(e%10 != 0){
		 eee = (Math.round((e) / 10))*10;
        }else{
         eee = e;
        }
      
		double zzz = aaa + bbb + ccc + ddd + eee + min + 30;
      	int ans = (int)zzz;
		System.out.println(ans);
	}
}