Solving Tower OF Hanoy Using Recursion in C

#include<stdio.h>
void toh(int n,char s,char d ,char t)
{
    if(n==1)
    {

        printf("MOVE DISK %d From %c to %c\n",n,s,d);

    }
    else
        {
       toh(n-1,s,t,d);
       printf("MOVE DISK %d From %c to %c\n",n,s,d);
       toh(n-1,t,d,s);

    }
}
int main(void)
{
    printf("Enter the Number Of Disks to move\n");
    int n;
    scanf("%d",&n);
    toh(n,'S','D','T');
    return 0;
}