Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		s := io.NextLine()
		if s == "." {
			break
		}
		t := io.NextLine()
		if s == t {
			io.Println("IDENTICAL")
			continue
		}
		ss := strings.Split(s, "\"")
		tt := strings.Split(t, "\"")
		if len(ss) != len(tt) {
			io.Println("DIFFERENT")
			continue
		}
		cnt := 0
		for i := 0; i < len(ss); i++ {
			if i%2 == 0 {
				if ss[i] != tt[i] {
					cnt = -1
					break
				}
			} else {
				if ss[i] != tt[i] {
					cnt++
				}
			}
		}
		if cnt > 1 || cnt == -1 {
			io.Println("DIFFERENT")
		} else {
			io.Println("CLOSE")
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef complex<double> xy_t;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
ll inf = llmax / 2;
double eps = 1e-11;

int main() {
    while (true) {
        string s1, s2;
        cin >> s1;
        if (s1 == ".") {
            break;
        }
        cin >> s2;
        vector<char> s1ch[200];
        vector<char> s2ch[200];
        int num1 = 0;
        for (int i = 0; i < s1.size(); i++) {
            if (s1[i] == '"') {
                num1++;
            } else {
                s1ch[num1].push_back(s1[i]);
            }
        }
        int num2 = 0;
        for (int i = 0; i < s2.size(); i++) {
            if (s2[i] == '"') {
                num2++;
            } else {
                s2ch[num2].push_back(s2[i]);
            }
        }
        int mark = 0;
        if (num1 != num2) {
            mark = 2;
        }
        for (int i = 0; i <= num1; i++) {
            bool m = true;
            int a = s1ch[i].size();
            int b = s2ch[i].size();
            if (a != b) {
                m = false;
            } else {
                for (int j = 0; j < a; j++) {
                    if (s1ch[i][j] != s2ch[i][j]) {
                        m = false;
                    }
                }
            }
            if (!m) {
                if (i % 2 == 0) {
                    mark = 2;
                } else {
                    if (mark < 2) {
                        mark++;
                    }
                }
            }
        }
        if (mark == 0) {
            //cout << "IDENTICAL" << endl;
        } else if (mark == 1) {
            //cout << "CLOSE" << endl;
        } else {
            //cout << "DIFFERENT" << endl;
        }
    }
}

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

using namespace std;

int main(){
    while(true){
        string s,t;
        cin>>s;
        if(s==".")break;
        cin>>t;
        int si=0,ti=0;
        bool dq=false;
        int stat=0;//0:IDENTICAL 1:CLOSE 2:DIFFERENT
        while(si<s.size()&&ti<t.size()){
            if(dq){
                if(s[si]!=t[ti]){
                    ++stat;
                    while(s[si]!='"')++si;
                    while(t[ti]!='"')++ti;
                    dq=false;
                }
                if(s[si]=='"')dq=false;
            }
            else{
                if(s[si]!=t[ti]){
                    stat=2;
                    goto end;
                }
                else if(s[si]=='"')dq=true;
            }
            ++si;++ti;
        }
        end:;
        if(stat==0&&s.size()!=t.size())stat=2;
        switch(stat){
            case 0:
                cout<<"IDENTICAL"<<endl;
                break;
            case 1:
                cout<<"CLOSE"<<endl;
                break;
            case 2:
                cout<<"DIFFERENT"<<endl;
                break;
        }
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <string>
#include <stack>
#include <regex>

#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<long long>
#define vvl vector<vector<long long>>

using namespace std;

typedef long long ll;

std::vector<std::string> split(std::string str, char del)
{
  int first = 0;
  int last = str.find_first_of(del);

  std::vector<std::string> result;

  while (first < str.size())
  {
    std::string subStr(str, first, last - first);

    result.push_back(subStr);

    first = last + 1;
    last = str.find_first_of(del, first);

    if (last == std::string::npos)
    {
      last = str.size();
    }
  }

  return result;
}

int main()
{
  string s1;
  string s2;
  while (true)
  {
    bool close = false;
    cin >> s1;
    if (s1 == ".")
    {
      break;
    }
    cin >> s2;
    if (s1 == s2)
    {
      cout << "IDENTICAL" << endl;
      continue;
    }

    int c1 = 0;
    int c2 = 0;

    REP(i, s1.size())
    {
      if (s1[i] == '"')
      {
        c1++;
      }
    }
    REP(i, s2.size())
    {
      if (s2[i] == '"')
      {
        c2++;
      }
    }
    if (c1 != c2)
    {
      cout << "DIFFERENT" << endl;
      continue;
    }

    vector<string> v1 = split(s1, '"');
    vector<string> v2 = split(s2, '"');
    if (v1.size() != v2.size())
    {
      cout << "DIFFERENT" << endl;
      continue;
    }

    REP(i, v1.size())
    {
      if (i % 2 == 0)
      {
        if (v1[i] != v2[i])
        {
          cout << "DIFFERENT" << endl;
          break;
        }
      }
      else
      {
        if (v1[i] != v2[i] && close)
        {
          cout << "DIFFERENT" << endl;
          close = false;
          break;
        }
        else if (v1[i] != v2[i] && !close)
        {
          close = true;
        }
      }
    }
    if (close)
    {
      cout << "CLOSE" << endl;
    }
  }
  return 0;
}