Park & Grab (Attribute Mystery #4) 🚗 Mystery Cache

This mystery is called park & grab because final location is next to a free parking lot for cars. So if you come with a car you can just park near the cache.

Posted coordinates are not of final location and are not a clue.

This mystery is coded in binary code. For those of you who are not familiar with this code, here's a quick introduction which will be enough to help you out. Binary code is made out of zero and one digits. This is eventually how all computing and all letters/numbers/symbols comes down to, 0's and 1's.

The following table will show you the values you need to know in binary, it is quite simple since we just need the values 0-9 for coordinates.

0 = 0000

1 = 0001

2 = 0010

3 = 0011

4 = 0100

5 = 0101

6 = 0110

7 = 0111

8 = 1000

9 = 1001

Now for the puzzle:

Each country represents either 1 or 0

A = China, India, Vietnam, Thailand

B = USA, Canada, Mexico, Costa Rica

C = Germany, Italy, Spain, Holland

D = Ethiopia, Kenya, Zambia, Nigeria

E = Cuba, Iceland, Fiji, Philippines

F = Brazil, Argentina, Peru, Chile

Cache location is at:

N 32 4.ABC , E 34 49.DEF

Too difficult? Ok how about this - 

Israel = 0, Cyprus = 1

France = 0, England = 1

South Korea = 0, Japan = 1

Much easier now, right?

So what is left to do? decode the 0's and 1's into the digits, and find where the cache is