Go: package main

import (
	"fmt"
	"math"
)

func main() {
	var a, b float64
	fmt.Scanf("%v %v", &a, &b)
	fmt.Println(math.Abs(a - b))
}

C++: #include "bits/stdc++.h"
using namespace std;

#define ASC(vec) vec.begin(), vec.end()    // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例：sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)

const int       mod = 1000000007;
const int       inf = (1 << 21);
const long long INF = 1LL << 60;

using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vii = vector<pair<int, int>>;
using vll = vector<pair<ll, ll>>;

template<class T>
inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T>
inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T>
T GCD(T a, T b) { if (b == 0) return a; else return GCD(b, a % b); }
template<class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }

constexpr array<int, 9> dx = { 0, 1, 0, -1, -1, 1, 1, -1, 0 };
constexpr array<int, 9> dy = { 1, 0, -1, 0, 1, 1, -1, -1, 0 };

// ──────────────────────────────────────────────────────────────────

int main() {
	int a, b;
	cin >> a >> b;

	cout << abs(a - b) << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
using ll = long long; 
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int main() {
	int a, b;
	cin >> a >> b;
	cout << abs(a - b) << endl;
	return 0;
}

C++: #include <iostream>
#include <cmath>
using namespace std;

int main(){
  int n,m;
  cin >> n >> m;
  cout << abs(n-m) << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main (){
  int x,y,z,z2;
  cin>> x >> y;
  z = y-x;

  if(z<0){
    z2=-z;
    cout<< z2 <<endl;
  }else{
    cout<<z<<endl;
  }
}

C++: #include<bits/stdc++.h>

using namespace std;

main(){
	int a,b;
	cin >>a>>b;
	if(a>b){
		printf("%d\n",a-b);
	}
	else if(b>a){
		printf("%d\n",b-a);
	}
	else{
		printf("%d\n",a-b);
	}
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b;
    cin>>a>>b;
    if (a<b){
        cout<<b-a<<endl;
    }
    else {
        cout<<a-b<<endl;
    }
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int a,b;
    cin>>a>>b;
    if(a<b){
        swap(a,b);
    }
    cout<<a-b<<endl;
}

C++: #include <iostream>
using namespace std;
int main(){

int x,y;
cin>>x>>y;

if(x>y) cout<<(x-y)<<endl;
else
cout<<(y-x)<< endl;

return 0;
}

C++: #include <iostream>

int main() {
  int x, y;

  std::cin >> x >> y;

  if (x < y) {
    std::cout << y - x << std::endl;
  } else {
    std::cout << x - y << std::endl;
  }

  return 0;
}

C++: #include<iostream>
using namespace std;
int x1,x2,y;
int main(){
cin>>x1>>x2;
if(x1<x2){
y=x2-x1;
}else{
y=x1-x2;
}
cout<<y<<endl;
return 0;
}

C++: #include <iostream>
using namespace std;
 
int main()
{
    int x, y;
 
    cin >> x >> y;
 
    if (x > y)
        cout << x - y << endl;
    else
        cout << y - x << endl;
 
    return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int a, b;
	cin >> a >> b;
	cout << abs(a - b) << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
typedef long long ll;
#define ALL(a) a, a+sizeof(a)/sizeof(a[0])
using namespace std;
ll gcd(ll n, ll m) {
	if (m == 0) return n;
	return gcd(m, n % m);
}

ll lcm(ll n, ll m) {
	return m / gcd(n, m) * n;
}

int main(void) {
	int x1,x2;
	cin >> x1 >> x2;
	cout << abs(x1-x2) << endl;
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int x1,x2;
    cin >> x1 >> x2;
    if(x1>x2)   cout << x1-x2 << endl;
    else        cout << x2-x1 << endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a,b;
    cin>>a>>b;
    if(a<b){cout<<b-a<<endl;
}else{cout<<a-b<<endl;}
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MAXN 100001

int main() {
    int a, b;
    cin >> a >> b;
    cout << abs(a-b) << endl;
}

C++: #include <iostream>
using namespace std;

int main(){
	int x1,x2;
	cin >> x1 >> x2;

		if( x1 < x2 )
		{
		cout << (x2-x1) << endl;
		}else{
		cout << (x1-x2) << endl;
		}

}

C++: #include <iostream>
using namespace std;
int main(){


    int a,b;
    cin >> a >>b;
    if(a<b)
    cout<< b-a << endl;
    else
    cout<< a-b << endl;


return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
	int x1, x2;
	cin >> x1 >> x2;
	if (x1 < x2)
		cout << x2 - x1 << endl;
	else
		cout << x1 - x2 << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int X,Y,a;
  cin>>X;
  cin>>Y;
  a=X-Y;
  if(a<0)
    a=a*-1;
  cout<<a<<endl;
  return(0);
}

C++: #include<iostream>
using namespace std;
int main(void)
{
int a,b;
cin >> a >> b;
if(a > b) cout  << a-b << endl;
else if(b > a)  cout  << b-a << endl;
else  cout  << a-b << endl;
}

C++: #include<bits//stdc++.h>
using namespace std;
int main(){
    int a,b; cin >>a >>b ;
    cout << abs(a-b)<<endl;
}

C++: #include<iostream>
#include<iomanip>
#include<string>
#include<set>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<functional>
using namespace std;
#define LL long long
#define MOD 100000
#define inf 1999999999

int a, b;

int main() {
	cin >> a >> b;
	cout << abs(a - b) << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
    int x1,x2;
    cin>>x1>>x2;
    cout<<abs(x1-x2)<<endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using ll  = long long;
#define int ll
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define erep(e,v) for(auto && e :v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9:(int)1e18)
#define EPS 0.0000000001
using namespace std;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<typename Head, typename Value> auto vectors(const Head &head, const Value &v) { return vector<Value>(head, v); }
template<typename Head, typename... Tail> auto vectors(Head x, Tail... tail) { auto inner = vectors(tail...); return vector<decltype(inner)>(x, inner); }
template<class T> void join(T a){for(auto itr :a){if(itr != *a.begin())cout << " "; cout << itr;} }
using ld  = long double;
using pii = pair<int,int>;
using piii = pair<int,pii>;
int W,H;
int dx[]={0,0,1,-1}, dy[]={1,-1,0,0};
bool valid(int x,int y){return (0<=x&&x<W)&&(0<=y&&y<H);}
signed main(){
    int a,b; cin >> a >> b;
    cout << abs(a-b) << endl;
}