#include<stdio.h>

 #include<math.h>

 #include<malloc.h>

 int isprime(long n);

 void decompose_to_primes(int n);

 int main()

 {

     decompose_to_primes();

     return ;

 }

 void decompose_to_primes(int n)

 {

     int num;

     int *prime[];

     int pi=;

     int temp,i,j,exp;

     temp=(int)sqrt(n);

     num=temp;

     prime[]=(int*)malloc(num*sizeof(int));

     prime[]=(int*)malloc(num*sizeof(int));

     if(n<)// n==2 or n==3

     {prime[][]=n;prime[][]=;pi++;}

     for(i=;i<=temp;i++)

         if(isprime(i))

         {

             exp=;

             j=i;

             while(n%j== && j<=n)

             {exp++;j*=i;}

             j/=i;

             //if(exp)

             {prime[][pi]=i;prime[][pi]=exp;

             pi++;

             n/=j;

             }

         }

         //output primefactors whose exp!=0

         for(i=;i<pi;i++)

             if(prime[][i]!=)

                 printf("<%d,%d> ",prime[][i],prime[][i]);

             printf("\n");

             free(prime[]);

             free(prime[]);

 }

 int isprime(long n)

 {

     int bound;

     int i;

     bound=(int)sqrt(n);

     for(i=;i<=bound;i++)

         if(n%i==)

             return ;

         return ;

 }