Problem: Now you get Baby Ehab's first words: "Given an integer n, find the longest subsequence of [1,2, …, n-1] whose product is 1 modulo n." Please solve the problem.

A sequence b is a subsequence of an array a if b can be obtained from a by deleting some (possibly all) elements. The product of an empty subsequence is equal to 1.

Input

The only line contains the integer n (2 ≤ n ≤ 10^5).

Output

The first line should contain a single integer, the length of the longest subsequence.

The second line should contain the elements of the subsequence, in increasing order.

If there are multiple solutions, you can print any.

Examples

Input


5


Output


3
1 2 3 

Input


8


Output


4
1 3 5 7 

Note

In the first example, the product of the elements is 6 which is congruent to 1 modulo 5. The only longer subsequence is [1,2,3,4]. Its product is 24 which is congruent to 4 modulo 5. Hence, the answer is [1,2,3].

Solution (in JAVA):

Solution:
import java.util.*;

public class solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] num = new int[100005];
        long pro = 1;
        int ans = 0;
        int count = 0;
        int n = sc.nextInt();
        for (int i = 1; i <= n; i++) {
            if (gcd(n, i) != 1) num[i] = 1;
        }
        for (int i = 1; i <= n; i++) {
            if (num[i] != 1) {
                pro *= i;
                pro %= n;
                count++;
                if (pro == 1) ans = count;
            }
        }
        System.out.println(ans);
        for (int i = 1; i <= n; i++) {
            if (num[i] == 0 && ans != 0) {
                System.out.print(i + " ");
                ans--;
            }
        }
    }
    public static int gcd(int x, int y) {
        if (x == 0) return y;
        return gcd(y % x, x);
    }

}