#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>int main()
{long long int l1,r1,l2,r2,k,x,y;scanf("%lld%lld%lld%lld%lld",&l1,&r1,&l2,&r2,&k);x=(l1>=l2)?l1:l2;y=(r1<=r2)?r1:r2;if(r1<l2||r2<l1){printf("0\n");}else{if(x<=k&&k<=y){printf("%lld\n",y-x);}else{printf("%lld\n",y-x+1);}}return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 5000000+10;
int a[N];
int main(int argc, char const *argv[])
{
int n;
cin >> n ;
for(int i = 1;i <= n ; i ++) cin >> a[i];sort(a + 1, a + 1 + n );int x  = unique(a+1,a + n+1) - a - 1;
//cout << a[1] << a[2] << a[3] << a[4] << endl;
//cout << x << endl;
if(x < 3 || (x == 3 &&a[2] - a[1] == a[3] - a[2] )){cout << "YES" << endl;}else cout << "NO" << endl;return 0;}

#include <bits/stdc++.h>
using namespace std;
const int N = 5000000+10;
struct Trie
{int ch[N][3];int sz;int val[N];void Init(){sz=1;memset(ch,0,sizeof ch);memset(val,0,sizeof val);}void Insert(char *num,int op){int u=0;for(int i=20;i>=strlen(num);i--){if(ch[u][0]==0)ch[u][0]=sz++;u=ch[u][0];}for(int i=0;i<strlen(num);i++){int c=(num[i]-'0')%2;if(ch[u][c]==0)ch[u][c]=sz++;u=ch[u][c];}val[u]+=op;}int Find(char *num){int u=0;int cur=0;for(int i=20;i>=strlen(num);i--){if(ch[u][0]==0)return 0;u=ch[u][0];cur+=val[u];}for(int i=0;i<strlen(num);i++){int c=(num[i]-'0')%2;if(ch[u][c]==0)return 0;u=ch[u][c];cur+=val[u];}return cur;}
};
Trie trie;
int main()
{trie.Init();int q;scanf("%d",&q);getchar();while(q--){char s[2];char x[20];scanf("%s%s",s,x);//cout<<"x="<<x<<endl;if(s[0]=='+')trie.Insert(x,1);if(s[0]=='?')printf("%d\n",trie.Find(x));if(s[0]=='-')trie.Insert(x,-1);}return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 5000000+10;
int a[N];int main(int argc, char const *argv[])
{int n , k;cin >> n >> k ;long long sum =  0;for(int i = 1;i <= n ;i ++){int  x;//cin >> x;cin >> a[i];if(a[i] - a[i - 1] > k) sum = 0;sum ++;}cout << sum << endl;return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 5000000+10;
int a[N];
int vis[30];
char str[1000005];
int main(int argc, char const *argv[])
{
//string str;cin >> str;int n = strlen(str);int i = 0 ;if(n < 26) {printf("-1\n");return 0;}bool flag = 1;for(int i = 0;i <= n - 26 && flag; i ++){int tail1 = 0 , tail2 = 0;memset(vis,0,sizeof vis);for(int j = i;j < i +  26 ;j ++){if(str[j] >= 'A' && str[j] <= 'Z'){//  cout << str[j] - 'A' << " " << j - i << endl;vis[str[j] - 'A'] ++;}else tail2 ++;// if(j = i + 25) break;
        }for(int j = 0;j < 26;j ++){if(vis[j] == 1)tail1 ++; }if(tail1 + tail2 == 26){int t = 0;for(int j = i;j < i + 26;j ++){if(str[j] == '?'){for(;t < 26;t ++){if(vis[t] == 0){str[j] = 'A' + t;t++;break;}}}}flag = 0;}//if(flag)
    }for(int i = 0;i < n;i ++){if(str[i] == '?'){str[i] = 'A';}}if(flag) cout << -1 << endl;else cout << str << endl;return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 5000000+10;
int a[N];
int vis[30];
char str[1000005];int main(int argc, char const *argv[])
{long long n ;cin >> n ;if(n == 1){cout << "2" << endl;}else{//int ans = 2;cout << "2" << endl;//3int k = 2;for(long long i = 2;i <= n ;i ++){cout << (i * (i + 1)*(i+1) - i + 1) << endl;// k = sqrt(k * (i + 1) + 1);//  ans ++;
        }   }return 0;
}