in binary tree...... why I get wrong answer

#include<stdio.h>
int main()
{     int c;
 long int n,a;
long int i,j;
scanf("%ld",&n);
for(a=1;a<=n;a++)
{
    scanf("%ld %ld",&i,&j);
    c=0;
    while(1)
    {
        if(i>1&&i>j)
        {
            if(i%2==0)
                i=i/2;
            else
                i=(i-1)/2;
            c++;
        }
        if(i==j)
            break;
        else if(j>1)
        {
            if(j%2==0)
                j=j/2;
            else
                j=(j-1)/2;
            c++;
        }
        if(i==j)
            break;
    }
    printf("%d\n",c);

}
return 0;
}