+ Time Limit: 1 second + Memory Limit: 256 megabytes ---------- Two strings are given in the input, and you are asked to check whether these two strings are beautiful together or not. Two strings are beautiful together if the first character of the first string is equal to the last character of the second string. # Input The input consists of two lines, each containing a string of lowercase English letters with a maximum length of 50. # Output Print the phrase `YES` if the two given strings are beautiful together, and `NO` otherwise. # Example ## Sample Input 1 ``` salam khodafes ``` ## Sample Output 1 ``` YES ``` Since the first character of the string `salam` is equal to the last character of the string `khodafes`, which is `s`, these two strings are beautiful together, and the phrase `YES` should be printed. ## Sample Input 2 ``` salam salam ``` ## Sample Output 2 ``` NO ``` Since the first character of the string `salam`, which is `s`, is not equal to the last character of the string `salam`, which is `m`, these two strings are not beautiful together, and the phrase `NO` should be printed. ## Sample Input 3 ``` snapp box ``` ## Sample Output 3 ``` NO ``` Since the first character of the string `snapp`, which is `s`, is not equal to the last character of the string `box`, which is `x`, these two strings are not beautiful together, and the phrase `NO` should be printed. ## Sample Input 4 ``` software engineers ``` ## Sample Output 4 ``` YES ``` Since the first character of the string `software` is equal to the last character of the string `engineers`, which is `s`, these two strings are beautiful together, and the phrase `YES` should be printed.