1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<cstdlib>
 5 #include<cmath>
 6 #include<algorithm>
 7 #define ll long long
 8 #define inf 1000000000
 9 using namespace std;
10 int read() {
11     int x=0,f=1;char ch=getchar();
12     while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}
13     while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}
14     return x*f;
15 }
16 int t1,t2,tmp,ans;
17 int a[5],b[5];
18 struct data {int a[5];};
19 data cal(int *a,int k) { //得到a状态向上走k次的状态
20     data ans;
21     int t1=a[2]-a[1],t2=a[3]-a[2];
22     for(int i=1; i<=3; i++)ans.a[i]=a[i];
23     if(t1==t2)return ans;
24     if(t1<t2) {
25         int t=min(k,(t2-1)/t1);
26         k-=t; tmp+=t;//顺便记录深度
27         ans.a[2]+=t*t1; ans.a[1]+=t*t1;
28     } else {
29         int t=min(k,(t1-1)/t2);
30         k-=t; tmp+=t;
31         ans.a[2]-=t*t2; ans.a[3]-=t*t2;
32     }
33     if(k)return cal(ans.a,k);//辗转相除
34     else return ans;
35 }
36 bool operator!=(data a,data b) {
37     for(int i=1; i<=3; i++)if(a.a[i]!=b.a[i])return 1;
38     return 0;
39 }
40 int main() {
41     for(int i=1; i<=3; i++)a[i]=read();
42     for(int i=1; i<=3; i++)b[i]=read();
43     sort(a+1,a+4); sort(b+1,b+4);
44     data t1=cal(a,inf); int d1=tmp; tmp=0;
45     data t2=cal(b,inf); int d2=tmp; tmp=0;
46     //t1,t2分别为a,b的根，d1,d2为深度
47     if(t1!=t2) { puts("NO"); return 0; }
48     if(d1>d2) {
49         swap(d1,d2);
50         for(int i=1; i<=3; i++)swap(a[i],b[i]);
51     }
52     ans=d2-d1;
53     t1=cal(b,ans);
54     for(int i=1; i<=3; i++)b[i]=t1.a[i]; //较深的向上调整
55     int l=0,r=d1;
56     while(l<=r) { //二分
57         int mid=(l+r)>>1;
58         if(cal(a,mid)!=cal(b,mid))l=mid+1;
59         else r=mid-1;
60     }
61     puts("YES");
62     printf("%d",ans+2*l);
63     return 0;
64 }