Let SeungIn’s house be the origin on a coordinate plane. There are three Best Buys around his house, one at (250, 0), one at (70, -240), and one at (-150, 200). There are four places that SeungIn considers for a restaurant: Cheesecake Factory at (75, 180), T.G.I.Friday’s at (0, 195), Papa John’s at (-168, 99), and Olive Garden at (-117, -156). Assuming that cost does not interfere with SeungIn’s decision of his path, and assuming that SeungIn will visit only one Best Buy and only one restaurant, the difference in length between the longest possible path and the shortest possible path is $x$. Find $[x]$ when $[n]$ is the greatest integer less than or equal to $n$.