1 #include<iostream>
  2 #include<cstdio>
  3 #include<cstring>
  4 #include<cstdlib>
  5 #include<algorithm>
  6 #include<cmath>
  7
  8 #define For(i,a,b) for(register int i=a;i<=b;++i)
  9 #define Re register
 10 using namespace std;
 11 struct Bal{
 12     int x,y,z;
 13 }b1,b2,rb1,rb2,bx1,bx2;
 14 int tp1,tp2;
 15 inline void read(int &v){
 16     v=0; bool fg=0;
 17     char c=getchar(); if(c=='-')fg=1;
 18     while(c<'0'||c>'9'){c=getchar(); if(c=='-')fg=1;}
 19     while(c>='0'&&c<='9'){v=v*10+c-'0',c=getchar(); if(c=='-')fg=1;}
 20     if(fg)v=-v;
 21 }
 22
 23 void getNT(Bal &b){ //使x,y,z有序
 24     if(b.x>b.y)swap(b.x,b.y);
 25     if(b.x>b.z)swap(b.x,b.z);
 26     if(b.y>b.z)swap(b.y,b.z);
 27 }
 28
 29 int ComeBack(Bal &b){ //跳到根节点
 30     int stp=0;
 31      getNT(b);
 32     while(b.x+b.z!=b.y*2){
 33         int d1=b.y-b.x;
 34         int d2=b.z-b.y;
 35         if(d1<d2){
 36             int tp=d2/d1;
 37             if(d2%d1==0)tp--;
 38             b.x+=tp*d1;
 39             b.y+=tp*d1;
 40             if(b.x>b.y)swap(b.x,b.y);
 41             stp+=tp;
 42         }else{
 43             int tp=d1/d2;
 44             if(d1%d2==0)tp--;
 45             b.y-=tp*d2;
 46             b.z-=tp*d2;
 47             if(b.z<b.y)swap(b.z,b.y);
 48             stp+=tp;
 49         }
 50     }
 51     return stp;
 52 }
 53
 54 bool QL(Bal a,Bal b){
 55     if(a.x==b.x&&a.y==b.y&&a.z==b.z)return 1;
 56     return 0;
 57 }
 58
 59 Bal CheckandGo(Bal bl,int Lim){ //二分出可以向上跳的距离然后向上跳
 60     Bal b=bl;
 61     int Lm=Lim;
 62     getNT(b);
 63     while(Lm){
 64         int d1=b.y-b.x;
 65         int d2=b.z-b.y;
 66         if(d1<d2){
 67             int tp=d2/d1;
 68             if(d2%d1==0)tp--;
 69             if(tp>Lm)tp=Lm;
 70             b.x+=tp*d1;
 71             b.y+=tp*d1;
 72             if(b.x>b.y)swap(b.x,b.y);
 73             Lm-=tp;
 74         }else{
 75             int tp=d1/d2;
 76             if(d1%d2==0)tp--;
 77             if(tp>Lm)tp=Lm;
 78             b.y-=tp*d2;
 79             b.z-=tp*d2;
 80             if(b.z<b.y)swap(b.z,b.y);
 81             Lm-=tp;
 82         }
 83         if(Lm==0)break;
 84     }
 85     return b;
 86 }
 87
 88 int main(){
 89 //    freopen("hop.in","r",stdin);
 90 //    freopen("hop.out","w",stdout);
 91     read(b1.x); read(b1.y); read(b1.z);
 92     read(b2.x); read(b2.y); read(b2.z);
 93
 94     getNT(b1); getNT(b2);
 95     bx1=b1; bx2=b2;
 96     tp1=ComeBack(bx1); tp2=ComeBack(bx2);
 97
 98
 99     if(!QL(bx1,bx2)){
100         printf("NO");
101     }else{
102         int bs=abs(tp1-tp2);
103         int l=0,r=min(tp1,tp2),ff;
104
105         if(tp1<tp2){//跳到同一深度
106             b2=CheckandGo(b2,bs);
107         }else{
108             b1=CheckandGo(b1,bs);
109         }
110
111         while(l<=r){ //二分
112             int m=(l+r)>>1;
113             bx1=CheckandGo(b1,m);
114             bx2=CheckandGo(b2,m);
115             if(QL(bx1,bx2))ff=m,r=m-1;
116             else l=m+1;
117         }
118         cout<<"YES"<<endl;
119         cout<<bs+ff*2<<endl;
120     }
121     return 0;
122 }