write a go solution for Description:
You are given five integers n, dx_1, dy_1, dx_2 and dy_2. You have to select n distinct pairs of integers (x_i,y_i) in such a way that, for every possible pair of integers (x,y), there exists exactly one triple of integers (a,b,i) meeting the following constraints:

begincasesx,=,x_i+a*dx_1+b*dx_2,y,=,y_i+a*dy_1+b*dy_2.endcases

Input Format:
The first line contains a single integer n (1<=n<=10^5).

The second line contains two integers dx_1 and dy_1 (-10^6<=dx_1,dy_1<=10^6).

The third line contains two integers dx_2 and dy_2 (-10^6<=dx_2,dy_2<=10^6).

Output Format:
If it is impossible to correctly select n pairs of integers, print NO.

Otherwise, print YES in the first line, and then n lines, the i-th of which contains two integers x_i and y_i (-10^9<=x_i,y_i<=10^9).

If there are multiple solutions, print any of them.

Note:
None. Output only the code with no comments, explanation, or additional text.