Abstract: We prove the endpoint case of a conjecture of Khot and Moshkovitz related to the Unique Games Conjecture, less a small error. Let . Suppose a subset of -dimensional Euclidean space satisfies and (up to measure zero sets) for every standard basis vector . For any and for any , let and let . For any , let denote the exterior normal vector at such that . Let . Our main result shows that has the smallest Gaussian surface area among all such subsets , less a small error: int_{partialOmega}gamma_{n}(x)dxgeq(1-6cdot 10^{-9})int_{partial B}gamma_{n}(x)dx+int_{partialOmega}Big(1-frac{|N(x)|_{1}}{sqrt{n}}Big)gamma_{n}(x)dx. In particular, int_{partialOmega}gamma_{n}(x)dxgeq(1-6cdot 10^{-9})int_{partial B}gamma_{n}(x)dx. Standard arguments extend these results to a corresponding weak inequality for noise stability. Removing the factor would prove the endpoint case of the Khot-Moshkovitz conjecture. Lastly, we prove a Euclidean analogue of the Khot and Moshkovitz conjecture. The full conjecture of Khot and Moshkovitz provides strong evidence for the truth of the Unique Games Conjecture, a central conjecture in theoretical computer science that is closely related to the P versus NP problem. So, our results also provide evidence for the truth of the Unique Games Conjecture. Nevertheless, this paper does not prove any case of the Unique Games conjecture.