RADICAL_NOU

#include <iostream>
#include <cstring>
using namespace std;
#define NMax 1000
typedef int Huge[NMax+3];

void AtribValue(Huge H, unsigned long X) {
  H[0] = 0;
  while (X) {
      ++H[0];
      H[H[0]] = X % 10;
      X /= 10;
  }
}

void CopyValue(Huge A,Huge B) /// A <- B
{
    for(int i=0;i<=B[0];++i)
        A[i]=B[i];
}

void Shl(Huge H, int Count)
/* H <- H*10ACount */
{
  /* Shifteaza vectorul cu Count pozitii */
  memmove(&H[Count+1],&H[1],sizeof(int)*H[0]);
  /* Umple primele Count pozitii cu 0 */
  memset(&H[1],0,sizeof(int)*Count);
  /* Incrementeaza numarul de cifre */
  H[0]+=Count;
}

void Shr(Huge H, int Count)
/* H <- H/10ACount */
{
  /* Shifteaza vectorul cu Count pozitii */
  memmove(&H[1],&H[Count+1],sizeof(int)*(H[0]-Count));
  /* Decrementeaza numarul de cifre */
  H[0]-=Count;
}

void Add(Huge A, Huge B)
/* A <- A+B */
{ int i,T=0;

  if (B[0]>A[0])
    { for (i=A[0]+1;i<=B[0];) A[i++]=0;
      A[0]=B[0];
    }
    else for (i=B[0]+1;i<=A[0];) B[i++]=0;
  for (i=1;i<=A[0];i++)
    { A[i]+=B[i]+T;
      T=A[i]/10;
      A[i]%=10;
    }
  if (T) A[++A[0]]=T;
}

void MultHuge(Huge A, Huge B, Huge C)
/* C <- A x B */
{ int i,j,T=0;

  C[0]=A[0]+B[0]-1;
  for (i=1;i<=A[0]+B[0];) C[i++]=0;
  for (i=1;i<=A[0];i++)
    for (j=1;j<=B[0];j++)
      C[i+j-1]+=A[i]*B[j];
  for (i=1;i<=C[0];i++)
    { T=(C[i]+=T)/10;
      C[i]%=10;
    }
  if (T) C[++C[0]]=T;
}

unsigned long Divide(Huge A, unsigned long X)
/* A <- A/X si intoarce A%X */
{ int i;
  unsigned long R=0;

  for (i=A[0];i;i--)
    { A[i]=(R=10*R+A[i])/X;
      R%=X;
    }
  while (!A[A[0]] && A[0]>1) A[0]--;
  return R;
}

int Sgn(Huge H1, Huge H2) {
  // Elimina zero-urile semnificative, daca exista.
  while (H1[0] && !H1[H1[0]]) H1[0]--;
  while (H2[0] && !H2[H2[0]]) H2[0]--;

  if (H1[0] < H2[0]) {
    return -1;
  } else if (H1[0] > H2[0]) {
    return +1;
  }

  for (int i = H1[0]; i > 0; --i) {
    if (H1[i] < H2[i]) {
      return -1;
    } else if (H1[i] > H2[i]) {
      return +1;
    }
  }
  return 0;
}

void Subtract(Huge A, Huge B)
/* A <- A-B */
{ int i, T=0;

  for (i=B[0]+1;i<=A[0];) B[i++]=0;
  for (i=1;i<=A[0];i++)
    A[i]+= (T=(A[i]-=B[i]+T)<0) ? 10 : 0;
    /* Adica A[i]=A[i]-(B[i]+T);
       if (A[i]<0) T=1; else T=0;
       if (T) A[i]+=10; */
  while (!A[A[0]]) A[0]--;
}

void DivideHuge(Huge A, Huge B)
/* A/B = C rest R */
{ int i;

  Huge C,R;
  R[0]=0;C[0]=A[0];
  for (i=A[0];i;i--)
    { Shl(R,1);R[1]=A[i];
      C[i]=0;
      while (Sgn(B,R)!=1)
        { C[i]++;
          Subtract(R,B);
        }
    }
  while (!C[C[0]] && C[0]>1) C[0]--;
  CopyValue(A,C);
}

/*
float radical(float a)
{
// avand valoarea egala cu precizia dorita in calculul radicalului
 float xn1=1, xn=(1+xn1)/2;
 do { xn1=xn;
 xn = (xn1+a/xn1)/2;
 } while (fabs(xn-xn1)>eps);
 // fabs(x) = |x|, unde x este numar real
 return xn;
// rezultatul este ultimul termen calculat al sirului
}
*/

void radical(Huge A,Huge XN)
{
    Huge XN1,C;
    AtribValue(XN1,1);
    AtribValue(XN,2);
    int semn;
    do
    {
        CopyValue(C,A);
        DivideHuge(C,XN1);
        CopyValue(XN,XN1);
        Add(XN,C);
        Divide(XN,2);
        semn=Sgn(XN,XN1);
     } while(semn==-1);
}

void Afisare(Huge A)
{
    for(unsigned int i=A[0];i>=1;--i)
        cout<<A[i];
    cout<<'\n';
}

int main()
{
    char s[30];
    Huge n,m;
    cin>>s;
    unsigned int L=strlen(s);
    for(unsigned int i=0;i<L;++i)
        n[L-i]=s[i]-'0';
    n[0]=L;
    cin>>s;
    L=strlen(s);
    for(unsigned int i=0;i<L;++i)
        m[L-i]=s[i]-'0';
    m[0]=L;
    Afisare(n);
    Afisare(m);
    Huge RAD;
    radical(n,RAD);
    cout<<RAD[0];
    Afisare(RAD);
    return 0;
}