#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define M 200000+5
int main(){
int a1,a2,a3,a4,i,j;
while(~scanf("%d %d %d %d",&a1,&a2,&a3,&a4)){
if((a1+a3)==2*a2&&(a2+a4)==2*a3)
printf("%d\n",2*a4-a3);
else if(a2*a2==a1*a3&&a2*a4==a3*a3){
if((a4*a4)%a3==0)
printf("%d\n",a4*a4/a3);
else puts("42");
}
else puts("42");
}
return 0;
}
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define M 200000+5
int main(){
int a1,a2,a3,a4,i,j;
while(~scanf("%d %d %d %d",&a1,&a2,&a3,&a4)){
if((a1+a3)==2*a2&&(a2+a4)==2*a3)
printf("%d\n",2*a4-a3);
else if(a2*a2==a1*a3&&a2*a4==a3*a3){
if((a4*a4)%a3==0)
printf("%d\n",a4*a4/a3);
else puts("42");
}
else puts("42");
}
return 0;
}