int comp(unsigned int N){
char *c_pole1=malloc(sizeof (char)*(N+1));
char *c_pole2=malloc(sizeof (char)*(N+1));
unsigned long o=1;
unsigned long q=0;
char c=0;
char d=0;
int x=0;
unsigned long d1_i=0;
unsigned long d2_i=0;
memset(c_pole1, 0, sizeof(char)*(N+1));
memset(c_pole2, 0, sizeof(char)*(N+1)); //nulovani pole

for(d1_i=0; d1_i<N; d1_i++){
    c = getchar();
    if(c == '\n')
    {
        q=1;
    }
    c_pole1[d1_i]=c;
}
while(q == 0){
    for(d2_i=0; d2_i<N; d2_i++){
        c = getchar();
        if(c == '\n')
        {
            q=1;
            break;
        }
        c_pole2[d2_i]=c;
    }
    if(strcmp(c_pole1, c_pole2) !=0 || ((c_pole2[0])==0)){
        if(o>1){
            d=o+'0';
            putchar(d);
        }
        for(d1_i=0; d1_i<N; d1_i++){
            if(c_pole1[d1_i] == 0){
                return(0);
            }
            putchar(c_pole1[d1_i]);
        }
        strcpy(c_pole1, c_pole2);
        o = 1;
    }
    else if (strcmp(c_pole1, c_pole2) ==0 && c == '\n'){
        if(o>1){
            d=o+'0';
            putchar(d);  //putchar('0'+(char)o)
        }
        for(d1_i=0; d1_i<N; d1_i++){
            if(c_pole1[d1_i] == 0){
                return(0);
            }
            putchar(c_pole1[d1_i]);
            x=1;

        }
    }

    else{
        o++;
    }
}
while((q == 1) && (x == 0)){
    for(d2_i=0; d2_i<N; d2_i++){
        if(c_pole1[d2_i] == 0){
            return(0);
        }
        putchar(c_pole2[d2_i]);
    }
  free(c_pole1);
  free(c_pole2);
  return(0);
}
return(1);
}