This is yet another beautiful puzzle from the NSA collection!
At a work picnic, Todd announces a challenge to his coworkers. Bruce and Ava are selected to play first. Todd places $100 on a table and explains the game. Bruce and Ava will each draw a random card from a standard 52-card deck. Each will hold that card to his/her forehead for the other person to see, but neither can see his/her own card. The players may not communicate in any way. Bruce and Ava will each write down a guess for the color of his/her own card, i.e. red or black. If either one of them guesses correctly, they both win $50. If they are both incorrect, they lose. He gives Bruce and Ava five minutes to devise a strategy beforehand by which they can guarantee that they each walk away with the $50.
Bruce and Ava complete their game and Todd announces the second level of the game. He places $200 on the table. He tells four of his coworkers — Emily, Charles, Doug and Fran—that they will play the same game, except this time guessing the suit of their own card, i.e. clubs, hearts, diamonds or spades. Again, Todd has the four players draw cards and place them on their foreheads so that each player can see the other three players’ cards, but not his/her own. Each player writes down a guess for the suit of his/her own card. If at least one of them guesses correctly, they each win $50. There is no communication while the game is in progress, but they have five minutes to devise a strategy beforehand by which they can be guaranteed to walk away with $50 each.
For each level of play – 2 players or 4 players– how can the players ensure that someone in the group always guesses correctly?
As always, please send your answers as comments within the blog (preferred), or send an e-mail to alokgoyal_2001@yahoo.com. Please do share the puzzle with others if you like, and please also send puzzles that you have come across that you think I can share in this blog.
Happy $50!
Alok Goyal's Puzzles Page 
[From Vishal] For both the days, lets draw a graph between his height and time. On day 1, it will start from 0 at 6am and end at h at 8pm. It will be a continuous graph. On day 2, the graph will start from h and go till 0. We can see that there will be a point where both the lines intersect. This is the point where the monk was on both the days at same time.
[From Suman and his daughter] If we mirrored the return journey on another monk on the same day (the original one is walking up), you can see they would cross each other at some point. This is the same point where the monk will have been while come down next day 🙂