// Verdict : Accepted
// Time : 0.00
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 10000
#define sf scanf
#define pf printf
using namespace std;

struct my
{
    char c;
    int in;
};

int main ()
{
    char ch[N],nam1[N],nam2[N],pnam1[N],pnam2[N];
    int namlen1=0,namlen2=0,slen=0,s=0,t1=0,t2=0,n=2,lenp1=0,lenp2=0;
    my ar[N];

    while (gets(nam1))
    {
        gets(nam2);

        char tch = 'a';

        for (int i=1;i<=26;i++)
        {
            ar[slen].c = tch;
            ar[slen].in = i;
            slen++; tch++;
        }

        /*for (int i=0;i<slen;i++)
        {
            pf ("%c %d; ",ar[i].c,ar[i].in);
        }*/

        for (int i=0;i<strlen(nam1);i++)
        {
            if (nam1[i]>='A' and nam1[i]<='Z')
            {
                pnam1[lenp1] = nam1[i]+32;
                lenp1++;
            }

            else if (nam1[i]>='a' and nam1[i]<='z')
            {
                pnam1[lenp1] = nam1[i];
                lenp1++;
            }

            else
            {
                continue;
            }
        }

        /*for (int i=0;i<lenp1;i++)
        {
            pf ("%c ",pnam1[i]);
        }*/

        for (int i=0;i<strlen(nam2);i++)
        {
            if (nam2[i]>='A' and nam2[i]<='Z')
            {
                pnam2[lenp2] = nam2[i]+32;
                lenp2++;
            }

            else if (nam2[i]>='a' and nam2[i]<='z')
            {
                pnam2[lenp2] = nam2[i];
                lenp2++;
            }

            else
            {
                continue;
            }
        }

        /*for (int i=0;i<lenp2;i++)
        {
            pf ("%c ",pnam2[i]);
        }*/

        for (int i=0;i<lenp1;i++)
        {
            for (int j=0;j<slen;j++)
            {
                if (pnam1[i] == ar[j].c)
                {
                    s+=ar[j].in;
                }
            }
        }

        //cout << s;

        int a=s,b=s;

        while (a!=0)
        {
            a%=10;
            t1+=a;
            b/=10;
            a=b;

            if (a==0)
            {
                if (t1<10)
                {
                    break;
                }

                else
                {
                    a = t1; b=t1; t1=0; s=0;
                }
            }
        }

        //cout << t1;
        s=0; a=0; b=0;

        for (int i=0;i<lenp2;i++)
        {
            for (int j=0;j<slen;j++)
            {
                if (pnam2[i] == ar[j].c)
                {
                    s+=ar[j].in;
                }
            }
        }

        a=s,b=s;

        while (a!=0)
        {
            a%=10;
            t2+=a;
            b/=10;
            a=b;

            if (a==0)
            {
                if (t2<10)
                {
                    break;
                }

                else
                {
                    a = t2;
                    b=t2;
                    t2=0;
                }
            }
        }

        //cout << t2;
        if (t1>t2)
        {
            //r = 1.0*(t2*100.0)/t1;
            pf ("%.2f %%\n",1.0*(t2*100.0)/t1);
        }

        else if (t1<t2)
        {
            pf ("%.2f %%\n",1.0*(t1*100.0)/t2);
        }

        else
        {
            pf ("100.00 %%\n");
        }

        lenp1 = 0; lenp2 = 0;t1=0;t2=0;s=0;a=0;b=0; slen=0;
    }

    return 0;
}