import java.util.*;

public class Dividers {
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int lim = (int)Math.sqrt(n);

        ArrayList<Integer> vertex= new ArrayList<Integer>();


        for (int i = 1; i < 10*lim; i++) {
            if (n % i == 0) vertex.add(i);
        }

        if (!vertex.contains(n)) vertex.add(n);

        Collections.sort(vertex);
        System.out.print("graph{ \n");

        for (int j = vertex.size()-1; j >= 0 ; j--){
            System.out.print(vertex.get(j) + "\n");
        }

        int len = vertex.size()-1;
        int count;


        for (int k = len; k > 0 ; k--) {
            count = 0;
            for (int m = k - 1; m >= 0; m--) {
                if (vertex.get(k) % vertex.get(m) == 0) {
                    count++;
                    if (count == 1) {
                        System.out.print(vertex.get(k) + "--" + vertex.get(m) + "\n");
                    }else {
                        for (int j = k-1; j > m; j--) {
                            if (vertex.get(j) % vertex.get(m) == 0) count = 100;
                        }
                        if( count != 100)
                        System.out.print(vertex.get(k) + "--" + vertex.get(m) + "\n");
                    }
                }
            }
        }

        System.out.print("}");
    }
}