Day 49

Zara is finding her way home, but she wants to take a route that visits her neighborhood as much as possible. From any square on the map shown, she can move up, down, left, or right a square (not diagonally).

She also wants to **visit every empty square exactly once**, entirely avoid the squares marked with "under construction" signs, and she wants her trip to end at her house.

**Is it possible for her to do this?**

You can just start drawing paths, or you can use logic!